On the suitability of trace semantics for modular proofs of communicating processes
Open Access
- 1 January 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 39, 47-68
- https://doi.org/10.1016/0304-3975(85)90130-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- Processes and the denotational semantics of concurrencyInformation and Control, 1982
- A calculus of total correctness for communicating processesScience of Computer Programming, 1981
- Proofs of Networks of ProcessesIEEE Transactions on Software Engineering, 1981
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- An axiomatic basis for computer programmingCommunications of the ACM, 1969