Formal Specification and Verification of Distributed Systems
- 1 November 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-9 (6) , 710-722
- https://doi.org/10.1109/tse.1983.235434
Abstract
Computations of distributed systems are extremely difficult to specify and verify using traditional techniques because the systems are inherently concurrent, asynchronous, and nondeterministic. Furthermore, computing nodes in a distributed system may be highly independent of each other, and the entire system may lack an accurate global clock.Keywords
This publication has 12 references indexed in Scilit:
- Formal Specification and Verification of Distributed SystemsIEEE Transactions on Software Engineering, 1983
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Proofs of Networks of ProcessesIEEE Transactions on Software Engineering, 1981
- Protocol Representation with Finite-State ModelsIEEE Transactions on Communications, 1980
- Principles of proving concurrent programs in GypsyPublished by Association for Computing Machinery (ACM) ,1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- A language for formal problem specificationCommunications of the ACM, 1977
- Petri NetsACM Computing Surveys, 1977
- The temporal logic of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- A note on reliable full-duplex transmission over half-duplex linksCommunications of the ACM, 1969