Two normal form theorems for CSP programs
- 1 December 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (4) , 165-171
- https://doi.org/10.1016/0020-0190(87)90001-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Correctness proofs of distributed termination algorithmsACM Transactions on Programming Languages and Systems, 1986
- Closed Covers: To Verify Progress for Communicating Finite State MachinesIEEE Transactions on Software Engineering, 1984
- On folk theoremsCommunications of the ACM, 1980
- Distributed TerminationACM Transactions on Programming Languages and Systems, 1980
- Communicating sequential processesCommunications of the ACM, 1978
- Some Properties of Predicate TransformersJournal of the ACM, 1978