Abstract
In this paper, we introduce a new abstraction mechanism, called a script, which hides the low-level details that implement patterns of communication. A script localizes the communication between a set of roles (formal processes), to which actual processes enroll to participate in the action of the script. The paper discusses the addition of scripts to the languages CSP and ADA, and to a shared-variable language with monitors. Proof rules are presented for proving partial correctness and freedom from deadlock in concurrent programs using scripts.
| Original language | English |
|---|---|
| Pages (from-to) | 35-88 |
| Number of pages | 54 |
| Journal | Science of Computer Programming |
| Volume | 6 |
| Issue number | C |
| DOIs | |
| State | Published - 1986 |
| Externally published | Yes |
Bibliographical note
Funding Information:We would like to thank the attendees of the 1983 IFIP Working Group 2.2 Meeting on Formal Description of Programming Concepts for their comments and suggestions on a early draft of this report. We also thank Shmuel Katz and Amir Pnueli for various discussions concerning the proof rules. Thanks are also due to K. R. Apt and an anonymous referee for their comments on an earlier draft of this paper. Part of the first author's work was supported by the fund for the promotion of research, the Technion.