Stepwise refinement and concurrency: the finite-state case
- 31 October 1990
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 14 (2-3) , 185-228
- https://doi.org/10.1016/0167-6423(90)90020-e
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A language independent proof of the soundness and completeness of generalized Hoare logicInformation and Computation, 1989
- Distributed cooperation with action systemsACM Transactions on Programming Languages and Systems, 1988
- A calculus of refinements for program derivationsActa Informatica, 1988
- An example of stepwise refinement of distributed programs: quiescence detectionACM Transactions on Programming Languages and Systems, 1986
- Correctness proofs of distributed termination algorithmsACM Transactions on Programming Languages and Systems, 1986
- Reasoning about networks with many identical finite-state processesPublished by Association for Computing Machinery (ACM) ,1986
- Decentralization of process nets with centralized controlPublished by Association for Computing Machinery (ACM) ,1983
- Synthesis of Resource Invariants for Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1980
- A note on the proof of a concurrent programInformation Processing Letters, 1979
- On the completeness of the inductive assertion methodJournal of Computer and System Sciences, 1975