Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Semantic Framework for the Abstract Model Checking of tccp programs 1
 

Summary: A Semantic Framework for the Abstract
Model Checking of tccp programs 1
Mar’a Alpuente a Mar’a del Mar Gallardo b Ernesto Pimentel b
Alicia Villanueva a
a DSIC, Technical University of Valencia Camino de Vera s/n, E­46022, Spain
b Dept. LCC, University of M’alaga Campus de Teatinos s/n, E­29071, Spain
Abstract
The Timed Concurrent Constraint programming language (tccp) introduces time
aspects into the Concurrent Constraint paradigm. This makes tccp especially ap­
propriate 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 di#cult task due to the subtleties of the underlying operational se­
mantics, which combines constraints, concurrency, non­determinism and time. Cur­
rently, 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

  

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

 

Collections: Computer Technologies and Information Sciences