Proving Correctness of CSP Programs — A Tutorial
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Modeling the distributed termination convention of CSPACM Transactions on Programming Languages and Systems, 1984
- The ``Hoare Logic'' of CSP, and All ThatACM Transactions on Programming Languages and Systems, 1984
- Ten years of Hoare's logic: A survey— part II: NondeterminismTheoretical Computer Science, 1983
- Formal Justification of a Proof System for Communicating Sequential ProcessesJournal of the ACM, 1983
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- Communicating sequential processesCommunications of the ACM, 1978
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Procedures and parameters: An axiomatic approachLecture Notes in Mathematics, 1971
- An axiomatic basis for computer programmingCommunications of the ACM, 1969