RICHARD D. SCHLICHTING University of Adzona FRED B. SCHNEIDER Cornell...  Home/Search
Context Related
| cornell.edu/fbs/publ...MsgPassRules.pdf From: cornell.edu/fbs/fullist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, proof rules are developed for a variety of messagepassing primitives. Two benefits accrue from this. The obvious one is that partial correctness proofs can be written for concurrent programs that use such primitives. This allows these programs to be understood as predicate transformers [6] or invariant maintainers [16], instead of by contemplating all possible execution An invariant is an assertion that is true throughout execution of a program. A program S is an invariant... (Update)
Context of citations to this paper: More
.... us to model memory sharing, and also asynchronous communication : channels can be represented by special shared variables (see e.g. [27]) The second new feature is shared transition : a transition shared by n processes models an action synchronously executed by these...
...show in [LG81] how the method of Owicki and Gries can be used to verify CSP processes. Furthermore, Schlichting and Schneider show in [SS84] how message passing primitives can be incorporated into this framework. As with sequential programs, the partial correctness of systems...
Cited by: More
Exploration of the Syntactical Modeling Capabilities in.. - Paez, Ruiz (1996) (Correct)
Development of Concurrent Systems - Incremental Transformation Pascal (Correct)
The "Hoare Logic" of CSP, and All That - Lamport, Schneider (1984) (Correct)
Active bibliography (related documents): More All
0.5: Objects in Different Execution Environments - Graupner (1997) (Correct)
0.4: Verification and Specification of Concurrent Programs - Lamport (1993) (Correct)
0.3: Task Dependence and Termination in Ada - Dillon (Correct)
Similar documents based on text: More All
0.2: win and sin: Predicate Transformers for Concurrency - Lamport (1990) (Correct)
0.2: A Natural Semantics for Eiffel Dynamic Binding - Attali, Caromel, Ehmety (1995) (Correct)
0.2: Separating Abstraction from Implementation in Communication.. - Caceres (Correct)
Related documents from co-citation: More All
8: Communicating Sequential Processes (context) - Hoare - 1985
6: An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
5: Hoare logic (context) - Lamport - 1980
BibTeX entry: (Update)
Richard D. Schlichting and Fred B. Schneider. Using Message Passing for Distributed Programming: Proof Rules and Disciplines. ACM Transactions on Programming Languages and Systems, pages 402-- 431, July 1984. http://citeseer.ist.psu.edu/schlichting84using.html More
@article{ schlichting84using,
author = "Richard D. Schlichting and Fred B. Schneider",
title = "Using Message Passing for Distributed Programming: Proof Rules, Disciplines",
journal = "Programming Languages and Systems",
volume = "6",
number = "3",
pages = "402-431",
year = "1984",
url = "citeseer.ist.psu.edu/schlichting84using.html" }
Citations (may not include all citations):208 An axiomatic proof technique for parallel programs (context) - OWICKI, GRIE - 1976
65 Hoare Logic (context) - LAMPORT, SCHNEIDER - 1984
46 Proofs of networks of processes (context) - MISRA, CHANDY - 1981
33 A proof system for communicating sequential processes (context) - APT, FRANCEZ et al. - 1980
28 Proof techniques for communicating sequential processes (context) - LEVIN, RIES - 1981
14 Xerox Palo Alto Research Center (context) - MITCHELL, MASUR et al. - 1979
11 Proving safety and liveness of communicating processes with .. (context) - MISRA, CHANDY et al. - 1982
11 Principles of proving concurrent programs in Gypsy (context) - GOOD, COHEN et al. - 1979
9 A calculus of total correctness for communicating processes (context) - HOARE - 1981
8 Semantic analysis of communicating sequential processes (context) - COUSOT, COUSOT - 1980
5 Axiomatic semantics of communicating sequential processes (context) - SOUNDARARAJAN - 1981
3 A proof system for concurrent Ada programs (context) - GERTH, DE ROEVER - 1983
3 Preliminary ADA Reference Manual (context) - ICHBIAH, KRIEG-BRUECKNER et al. - 1979
2 Distributed processes: A concurrent programming concept (context) - NCH
1 Procedures and concurrency: A study in proof (context) - GERTH, DE ROEVER et al. - 1982
1 An axiomatic basis for computer programming (context) - HOSE - 1969
1 A Discipline ol Programming (context) - DIJKSTRA - 1976
1 Communicating sequential processes (context) - HOSE - 1978
1 Extended naming conventions for communicating processes (context) - FRANCEZ
1 Computer Networks (context) - TANENSAtM
1 Axioms and proof rules for Ada tasks (context) - BARRINGER, MEARNS - 1982
1 Program proving (context) - CLINT - 1973
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/fbs/fullist.htm): More
Implementing Fault-Tolerant Services Using the State Machine.. - Schneider (1990) (Correct)
IRM Enforcement of Java Stack Inspection - Erlingsson, Schneider (2000) (Correct)
User Recovery and Reversal in Interactive Systems - Archer, Jr., Conway, Schneider (1984) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC