Abstract Model Checking of tccp programs

The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially appropriate to analyze by model checking timing properties of concurrent systems. However, even if very compact state representations are obtained t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic notes in theoretical computer science Jg. 112; S. 19 - 36
Hauptverfasser: Alpuente, María, del Mar Gallardo, María, Pimentel, Ernesto, Villanueva, Alicia
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 02.01.2005
Schlagworte:
Abstract Interpretation
Model Checking
Timed Concurrent Constraint Programming
Abstract Interpretation
Timed Concurrent Constraint Programming
Model Checking
ISSN:1571-0661, 1571-0661
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially appropriate to analyze by model checking timing properties of concurrent systems. However, even if very compact state representations are obtained thanks to the use of constraints in tccp, large state spaces can be still generated which may prevent model checking tools from verifying tccp programs completely. In this paper, we introduce an abstract methodology which is based on over- and under-approximating tccp models and mitigates the state explosion problem which is common to traditional model checking algorithms. We ascertain the conditions for the correctness of the abstract technique and show that, due to the timing aspects of the language, this semantics does not correctly simulate the suspension behavior, which is a key feature of tccp. Then, we present a refined abstract semantics which correctly models suspension.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2004.01.024