Proving partial order properties
- 25 April 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 126 (2) , 143-182
- https://doi.org/10.1016/0304-3975(94)90009-4
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSPTheoretical Computer Science, 1987
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- A proof rule for fair termination of guarded commandsInformation and Control, 1985
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982
- Decomposition of distributed programs into communication-closed layersScience of Computer Programming, 1982
- Recursive assertions and parallel programsActa Informatica, 1981
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Program proving: CoroutinesActa Informatica, 1973