Verification of distributed programs using representative interleaving sequences
- 1 September 1992
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 6 (2) , 107-120
- https://doi.org/10.1007/bf02252682
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Proving partial order liveness propertiesPublished by Springer Nature ,2005
- Event fairness and non-interleaving concurrencyFormal Aspects of Computing, 1989
- Completing the temporal picturePublished by Springer Nature ,1989
- Appraising fairness in languages for distributed programmingDistributed Computing, 1988
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Partial ordering derivations for CCSPublished by Springer Nature ,1985
- Alternative semantics for temporal logicsTheoretical Computer Science, 1983
- Decomposition of distributed programs into communication-closed layersScience of Computer Programming, 1982
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980