Specifying modules to satisfy interfaces: A state transition system approach
- 1 July 1992
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 6 (1), 39-63
- https://doi.org/10.1007/bf02276640
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A relational notation for state transition systemsIEEE Transactions on Software Engineering, 1990
- A simple approach to specifying concurrent systemsCommunications of the ACM, 1989
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- What it means for a concurrent program to satisfy a specificationPublished by Association for Computing Machinery (ACM) ,1985
- Adequate proof principles for invariance and liveness properties of concurrent programsScience of Computer Programming, 1984
- Protocol Verification via ProjectionsIEEE Transactions on Software Engineering, 1984
- An assertional correctness proof of a distributed algorithmScience of Computer Programming, 1982
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Proofs of Networks of ProcessesIEEE Transactions on Software Engineering, 1981
- An axiomatic proof technique for parallel programs IActa Informatica, 1976