A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
Authors:
- 15 September 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 183 (2) , 253-279
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- DUALITY: A simple formalism for the analysis of UNITYFormal Aspects of Computing, 1995
- Predicate transformers for reasoning about concurrent computationScience of Computer Programming, 1995
- Invariants, composition, and substitutionActa Informatica, 1995
- Composition of assumption-commitment specifications in a UNITY styleScience of Computer Programming, 1994
- Composing specificationsACM Transactions on Programming Languages and Systems, 1993
- Derivation of concurrent programs: two examplesScience of Computer Programming, 1992
- The existence of refinement mappingsTheoretical Computer Science, 1991
- win and sin : predicate transformers for concurrencyACM Transactions on Programming Languages and Systems, 1990
- A predicate transformer for progressInformation Processing Letters, 1990
- Proofs of Networks of ProcessesIEEE Transactions on Software Engineering, 1981