Proving concurrent constraint programs correct

Proving concurrent constraint programs correct

We introduce a simple compositional proof system for proving (partial) correctness of concurrent constraint programs (CCP). The proof system is based on a denotational approximation of the strongest postcondition semantics of CCP programs. The proof system is proved to be correct for full CCP and co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on programming languages and systems 1997-09, Vol.19 (5), p.685-725
Hauptverfasser: De Boer, Frank S., Gabbrielli, Maurizio, Marchiori, Elena, Palamidessi, Catuscia
Format: Artikel
Sprache:eng
Schlagworte:
Analysis
Computing methodologies
Concurrent computing methodologies
Concurrent programming
Concurrent programming languages
Denotational semantics
Formal language definitions
General programming languages
Language types
Logic
Multitasking
Pre- and post-conditions
Program reasoning
Program semantics
Programming languages
Programming logic
Proof theory
Semantics
Semantics and reasoning
Software and its engineering
Software notations and tools
Theory of computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We introduce a simple compositional proof system for proving (partial) correctness of concurrent constraint programs (CCP). The proof system is based on a denotational approximation of the strongest postcondition semantics of CCP programs. The proof system is proved to be correct for full CCP and complete for the class of programs in which the denotational semantics characterizes exactly the strongest postcondition. This class includes the so-called confluent CCP, a special case of which is constraint logic programming with dynamic scheduling.
ISSN:0164-0925
1558-4593
DOI:10.1145/265943.265954