Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Symbolic Model Checking for Timed Concurrent Constraint Programs ?
 

Summary: Symbolic Model Checking for Timed Concurrent
Constraint Programs ?
M. Alpuente 1 , M. Falaschi 2 , and A. Villanueva 1
1 Departamento de Sistemas Informaticos y Computacion, UPV, Spain
falpuente,villanueg@dsic.uvp.es
2 Dipartimento di Matematica e Informatica, U. di Udine, Italy
falaschi@dimi.uniud.it
Abstract As the complexity of software systems increases, automatic
veri cation tools which are able to guarantee the correct behavior of such
systems are dramatically lacking. Model checking is a formal veri cation
technique which allows one to automatically check whether a speci c
property is satis ed by a model of the system; otherwise it provides a
counterexample which helps the programmer to debug the wrong code.
In this paper we develop a symbolic model checking technique for the
Timed Concurrent Constraint Language (tccp), a declarative language
within the concurrent constraint paradigm which allows one to program
reactive systems in a very natural way. Two of the most important fea-
tures of the language are the use of constraints and a notion of time which
is within the operational model. By taking advantage of these two fea-
tures and using an extension of Di erence Decision Diagrams (DDDs),

  

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

 

Collections: Computer Technologies and Information Sciences