Abstract

In the transition axiom method, safety properties of a concurrent system can be specified by programs; liveness properties are specified by assertions in a simple temporal logic. The method is described with some simple examples, and its logical foundation is informally explored through a careful examination of what it means to implement a specification. Language issues and other practical details are largely ignored.

Citations

3118	Communicating sequential processes - Hoare - 1978
1225	A calculus of communicating systems - Milner - 1980
611	Systematic Software Development Using VDM - Jones - 1990
350	F.B.: Defining liveness - Alpern, Schneider - 1985
287	An Axiomatic Proof Technique for Parallel Programs I - Owicki, Gries - 1976
215	Concurrency control in distributed database systems - Bernstein, Goodman - 1981
178	Specifying concurrent program modules - Lamport - 1983
170	What good is temporal logic - Lamport - 1983
138	L.: Proving liveness properties of concurrent programs - Owicki, Lamport - 1982
76	A really abstract concurrent model and its temporal logic - Barringer, Kuiper, et al. - 1986
23	Systematic Software Development Using VDM. Prentice-Hall International, Englewood Cliffs - Jones - 1990
11	Verifying temporal properties without using temporal logic - Alpern, Schneider - 1989
11	Reasoning about nonatomic operations - Lamport - 1983
10	What it means for a concurrent program to satisfy a specification: Why no one has specified priority - LAMPORT - 1985
8	Sometime' is sometimes `not never': A tutorial on the temporal logic of programs - Lamport - 1980
4	et al. Distributed Systems: Methods and Tools for Specification, chapter 5 - Alford - 1985
2	Wensley et al. SIFT: design and analysis of a fault-tolerant computer for aircraft control - unknown authors - 1978