Academic Journal

Automatic verification of timed concurrent constraint programs

Bibliographic Details
Title: Automatic verification of timed concurrent constraint programs
Authors: FALASCHI, MORENO, Villanueva A.
Contributors: Falaschi, Moreno, Villanueva, A.
Source: Theory and Practice of Logic Programming. 6:265-300
Publication Status: Preprint
Publisher Information: Cambridge University Press (CUP), 2006.
Publication Year: 2006
Subject Terms: FOS: Computer and information sciences, Model checking, Computer Science - Logic in Computer Science, Timed concurrent constraint programming, 0202 electrical engineering, electronic engineering, information engineering, Automatic verification, Reactive systems, Reactive system, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO)
Description: The language Timed Concurrent Constraint (tccp) is the extension over time of the Concurrent Constraint Programming (cc) paradigm that allows us to specify concurrent systems where timing is critical, for example reactive systems. Systems which may have an infinite number of states can be specified in tccp. Model checking is a technique which is able to verify finite-state systems with a huge number of states in an automatic way. In the last years several studies have investigated how to extend model checking techniques to systems with an infinite number of states. In this paper we propose an approach which exploits the computation model of tccp. Constraint based computations allow us to define a methodology for applying a model checking algorithm to (a class of) infinite-state systems. We extend the classical algorithm of model checking for LTL to a specific logic defined for the verification of tccp and to the tccp Structure which we define in this work for modeling the program behavior. We define a restriction on the time in order to get a finite model and then we develop some illustrative examples. To the best of our knowledge this is the first approach that defines a model checking methodology for tccp.
Document Type: Article
File Description: application/pdf; STAMPA
Language: English
ISSN: 1475-3081
1471-0684
DOI: 10.1017/s1471068406002675
DOI: 10.48550/arxiv.cs/0505026
Access URL: http://arxiv.org/pdf/cs/0505026
http://arxiv.org/abs/cs/0505026
https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/automatic-verification-of-timed-concurrent-constraint-programs/E4F105EE3B2586C974ECBF75CC1B2C35
https://dblp.uni-trier.de/db/journals/corr/corr0505.html#abs-cs-0505026
https://arxiv.org/abs/cs/0505026
https://usiena-air.unisi.it/handle/11365/26186
Rights: Cambridge Core User Agreement
arXiv Non-Exclusive Distribution
Accession Number: edsair.doi.dedup.....e36e32d2aa62a3a6aa2202679c4e13cd
Database: OpenAIRE
Description
ISSN:14753081
14710684
DOI:10.1017/s1471068406002675