A semantic framework for the 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 for analyzing timing properties of concurrent systems by model checking. However, even if very compact state representations are obtain...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 346; H. 1; S. 58 - 95
Hauptverfasser: Alpuente, María, del Mar Gallardo, María, Pimentel, Ernesto, Villanueva, Alicia
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 23.11.2005
Elsevier
Schlagworte:
Abstract interpretation
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Language theory and syntactical analysis
Miscellaneous
Model checking
Programming theory
Theoretical computing
Timed Concurrent Constraint programming
Model checking
Abstract interpretation
Timed Concurrent Constraint programming
Paradigm
Computer theory
Methodology
Operational semantics
Constraint
Concurrent
Suspension
State space
Explosions
Representation
State space method
Checking program
Interpretation
Algorithm
Non determinism
Programming language
Concurrency
Behavior
Timing
ISSN:0304-3975, 1879-2294
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 for analyzing timing properties of concurrent systems by model checking. However, even if very compact state representations are obtained thanks to the use of constraints in tccp, large state spaces can still be generated, which may prevent model-checking tools from verifying tccp programs completely. Model checking tccp programs is a difficult task due to the subtleties of the underlying operational semantics, which combines constraints, concurrency, non-determinism and time. Currently, there is no practical model-checking tool that is applicable to tccp. In this work, we introduce an abstract methodology which is based on over- and under-approximating tccp models and which mitigates the state explosion problem that is common to traditional model-checking algorithms. We ascertain the conditions for the correctness of the abstract technique and show that this preliminary abstract 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. Finally, we complete our methodology by approximating the temporal properties that must be verified.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2005.08.009