Trace-based network proof systems: expressiveness and completeness

We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	ACM transactions on programming languages and systems 1992-05, Vol.14 (3), p.396-416
Hauptverfasser:	Widom, Jennifer, Gries, David, Schneider, Fred B.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Computing methodologies Concurrent computing methodologies Concurrent programming languages Correctness Exact sciences and technology Formal language definitions General programming languages Language types Logic Program reasoning Program semantics Proof theory Semantics Semantics and reasoning Software Software and its engineering Software engineering Software functional properties Software notations and tools Software organization and properties Symbolic and algebraic algorithms Symbolic and algebraic manipulation Theorem proving algorithms Theory of computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions.
ISSN:	0164-0925 1558-4593
DOI:	10.1145/129393.129396