We present a formal proof method which is based on a partial order semantics for parallel or distributed programs. In this view, a program's semantics is given by a collection of partial orders of the events which can occur during execution. Rather than using the partial orders directly, the basis of the method assumes the sets of (linear) execution sequences with global states which are consistent with each partial order (each such set is called an interleaving set). The proof rules allow concluding the correctness of certain classes of properties for all execution sequences, even though the property is only demonstrated directly for a subset of the execution sequences. The subset used must include a representative sequence from each interleaving set, and the proof rules guarantee that this is the case when they may be applied. The method employs proof lattices, and is expressed using the temporal logic ISTL*. By choosing a subset with appropriate sequences, simpler intermediate assertions can be used than in previous formal approaches. Moreover, since less direct checking must be done, the method is often much more efficient.
|Title of host publication||Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency - School/Workshop|
|Editors||J.W. de Bakker, G. Rozenberg, W.-P. de Roever|
|Number of pages||19|
|State||Published - 1989|
|Event||Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, 1988 - Noordwijkerhout, Netherlands|
Duration: 30 May 1988 → 3 Jun 1988
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, 1988|
|Period||30/05/88 → 3/06/88|
Bibliographical notePublisher Copyright:
© 1989, Springer-Verlag.
- Execution sequences
- Partial order semantics
- Proof lattices
- Temporal logic