Using message passing for distributed programming: proof rules and disciplines
- 1 July 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 6 (3), 402-431
- https://doi.org/10.1145/579.583
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The ``Hoare Logic'' of CSP, and All ThatACM Transactions on Programming Languages and Systems, 1984
- Procedures and concurrency: A study in proofLecture Notes in Computer Science, 1982
- A sound and complete HOARE axiomatization of the ADA-rendezvousPublished by Springer Science and Business Media LLC ,1982
- A calculus of total correctness for communicating processesScience of Computer Programming, 1981
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- Semantic analysis of communicating sequential processesLecture Notes in Computer Science, 1980
- Preliminary Ada reference manualACM SIGPLAN Notices, 1979
- Distributed processesCommunications of the ACM, 1978
- Communicating sequential processesCommunications of the ACM, 1978
- An axiomatic basis for computer programmingCommunications of the ACM, 1969