Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Abstract Model Checking of tccp programs Mar a Alpuente 1;2 Mar a del Mar Gallardo 1;3
 

Summary: Abstract Model Checking of tccp programs
Mara Alpuente 1;2 Mara del Mar Gallardo 1;3
Ernesto Pimentel 1;4 Alicia Villanueva 1;5
Abstract
The Timed Concurrent Constraint programming language (tccp) introduces time
aspects into the Concurrent Constraint paradigm. This makes tccp especially ap-
propriate 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 in-
troduce an abstract methodology which is based on over{ and under{aproximating
tccp models and mitigates the state explosion problem which is common to tradi-
tional 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 an re ned abstract semantics which correctly
models suspension.
1 Introduction
In the past few years, some extensions of the concurrent constraint paradigm
[21] have been de ned in order to model reactive systems. All these extensions

  

Source: Alpuente, María - Departamento de Sistemas Informáticos y Computación, Universitat Politècnica de València

 

Collections: Computer Technologies and Information Sciences