Proving Liveness Properties of Concurrent Programs

A liveness property asserts that program execution eventually reaches some desirable state. While termination has been studied extensively, many other liveness properties are important for concurrent programs. A formal proof method, based on temporal logic, for deriving liveness properties is presen...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	ACM Trans. Program. Lang. Syst.; (United States) 1982-07, Vol.4 (3), p.455-495
Hauptverfasser:	Owicki, Susan, Lamport, Leslie
Format:	Artikel
Sprache:	eng
Schlagworte:	990200 - Mathematics & Computers Artificial intelligence Computing methodologies Concurrent computing methodologies Concurrent programming languages Contextual software domains Correctness GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE General programming languages Knowledge representation and reasoning Language types Logic Modal and temporal logics Multiprocessing / multiprogramming / multitasking Operating systems PARALLEL PROCESSING Process management Program reasoning Program semantics PROGRAMMING PROGRAMMING LANGUAGES Proof theory Semantics and reasoning Software and its engineering Software functional properties Software notations and tools Software organization and properties Temporal reasoning TESTING Theory of computation VALIDATION
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A liveness property asserts that program execution eventually reaches some desirable state. While termination has been studied extensively, many other liveness properties are important for concurrent programs. A formal proof method, based on temporal logic, for deriving liveness properties is presented. It allows a rigorous formulation of simple informal arguments. How to reason with temporal logic and how to use safety (invariance) properties in proving liveness is shown. The method is illustrated using, first, a simple programming language without synchronization primitives, then one with semaphores. However, it is applicable to any programming language. 18 references.
ISSN:	0164-0925 1558-4593
DOI:	10.1145/357172.357178