Name
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. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1016/0167-6423(86)90018-3 | Logics and models of concurrent systems |
Keywords | Field | DocType |
communication abstraction mechanism | Abstraction,Programming language,Computer science,Deadlock,Correctness,Concurrent computing,Scripting language | Journal |
Volume | Issue | ISSN |
6 | 1 | 0167-6423 |
ISBN | Citations | PageRank |
0-387-15181-8 | 40 | 9.13 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Francez | 1 | 144 | 33.46 |
| Brent Hailpern | 2 | 515 | 100.51 |
| G. Taubenfeld | 3 | 51 | 10.41 |