A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Abstract Model Checking of tccp programs
2005
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
This makes tccp especially appropriate to analyze by model checking timing properties of concurrent systems. ...
tccp programs completely. ...
Applying abstract model checking involves the abstraction of both the model to be analyzed (M) and the properties to be checked within the model. ...
doi:10.1016/j.entcs.2004.01.024
fatcat:myptasjcb5bglisyelehbzgpm4
A semantic framework for the abstract model checking of tccp programs
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
This makes tccp especially appropriate for analyzing timing properties of concurrent systems by model checking. ...
To the best of our knowledge, this is the first total correctness result for abstract model checking of tccp programs in the literature. ...
doi:10.1016/j.tcs.2005.08.009
fatcat:k5d4p46bzjh57cxw46dbupfqty
Abstract Analysis of Universal Properties for tccp
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The Timed Concurrent Constraint Language (tccp) is a time extension of the concurrent constraint paradigm of Saraswat. tccp was defined to model reactive systems, where infinite behaviors arise naturally ...
On the basis of that semantic framework, this paper proposes an abstract semantics that, together with a widening operator, is suitable for the definition of different analyses for tccp programs. ...
In [8] , it was defined a model checking algorithm for tccp which allowed us to verify timed-depending properties. ...
doi:10.1007/978-3-319-27436-2_10
fatcat:ffzrnho7cve3pjb6ry5lezwz7u
Bridging the Gap between Two Concurrent Constraint Languages
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The cc model replaces the notion of store-as-valuation with the notion of store-as-constraint. There exist several programming languages that extend the cc model by introducing a notion of time. ...
We show how utcc can be mapped into tccp by means of a transformation that preserves the original behavior. We also prove the correctness of the transformation. ...
By transforming utcc programs into tccp programs, we are able to apply over the resulting tccp program other techniques such as the abstraction method of [2] or the interpreter presented in [9] . ...
doi:10.1007/978-3-642-20775-4_9
fatcat:6pegik4zsvfz3odjkuk3o73uva
A Symbolic Model Checker for tccp Programs
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model-checking algorithm for reactive systems. ...
We show how the symbolic approach to model checking for tccp improves previous approaches based on the classical Linear Time Logic (LTL) model checking algorithm. ...
In previous works ( [8, 9] ) we have defined an explicit model checking algorithm for tccp programs. ...
doi:10.1007/11423331_5
fatcat:koere7d62zbchblctnsj76pixu
Abstract Diagnosis for Timed Concurrent Constraint programs
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper, we provide a general framework for the debugging of tccp programs. ...
We show the efficacy of our approach by introducing two illustrative examples. We choose a specific abstract domain and show how we can detect that a program is erroneous. ...
There, a framework for the abstract model checking of tccp programs based on a source-to-source transformation is defined. ...
arXiv:1109.1587v1
fatcat:twwjg67ptnee3nus5cfotb4you
A Tool for Generating a Symbolic Representation of tccp Executions
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The resulting structure allows one to verify the program by using a model-checking algorithm. ...
In this paper, we describe the StructGenerator system which, given the specification of a tccp program, constructs a symbolic representation (a tccp Structure) modeling the behavior of such tccp program ...
A model-checking algorithm for tccp was proposed in [6] which given a tccp program transforms it into a symbolic representation (the tccp Structure) which is the input of the verification phase. ...
doi:10.1016/j.entcs.2009.07.019
fatcat:7we3kkovtndflht76x5dlgvywu
Automatic Verification of Timed Concurrent Constraint Programs
[article]
2005
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 ...
To the best of our knowledge this is the first approach that defines a model checking methodology for tccp. ...
Let us now develop a model-checking technique to tccp programs. ...
arXiv:cs/0505026v1
fatcat:s5sb7ttg3jgpbmv5u67plost6i
Abstract diagnosis for timed concurrent constraint programs
2011
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide a general framework for the debugging of tccp programs. ...
We show the efficacy of our approach by introducing two illustrative examples. We choose a specific abstract domain and show how we can detect that a program is erroneous. ...
There, a framework for the abstract model checking of tccp programs based on a source-tosource transformation is defined. ...
doi:10.1017/s1471068411000135
fatcat:pkioqvlx35cnfdhdea2coavgci
Towards an Effective Decision Procedure for LTL formulas with Constraints
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In order to check an LTL property for a process, our approach is based on the abstract diagnosis technique. ...
The concluding step of this technique needs to check the validity of an LTL formula (with constraints) in an effective way. ...
All the proposals of model checking have in common that a subset of the model of the (target) program has to be built, and sometimes the needed fragment is quite huge. ...
arXiv:1308.4171v1
fatcat:6felt3h6urbqzmfdnrc7ph3u6m
Abstract Diagnosis for tccp using a Linear Temporal Logic
2014
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Most of the classical approaches are based on browsing the structure of some form of model (which represents the behavior of the program) to check if a given specification is valid. ...
Our proposal (based on abstract interpretation techniques) does not require to build any model at all. ...
All the proposals of model checking have in common that a part of the model of the (target) program has to be built, and sometimes the needed fragment is quite huge. ...
doi:10.1017/s1471068414000349
fatcat:s2ktpyhm65cjlfhefth47m6waa
A Timed Concurrent Constraint Language
2000
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Moreover, we study the semantics and expressive power of the notion of maximal parallelism underlying the computational model of tccp: We define a fully abstract semantics for a sublanguage of tccp, called ...
We define the operational semantics of tccp by means of a transition system and we define a denotational model which is fully abstract with respect to the usual notion of observables (that is, the results ...
CONCLUSIONS We have defined the language tccp, a timed extension of ccp, and we have defined a fully abstract model for it and for its sublanguage ccpm. ...
doi:10.1006/inco.1999.2879
fatcat:3tb4y3s2drgfxjpk72aw6jmmlm
A program analysis framework for tccp based on abstract interpretation
2017
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The Timed Concurrent Constraint Language (tccp) is a timed extension of the concurrent constraint paradigm. tccp was defined to model reactive systems, where infinite behaviors arise naturally. ...
On the basis of that semantic framework, this paper proposes an abstract semantics that, together with a widening operator, is suitable for the definition of different analyses for tccp programs. ...
Given a tccp program, any instance of the abstraction framework computes an abstract graph that can be used to check relevant (temporal) system properties. ...
doi:10.1007/s00165-016-0409-8
fatcat:pq7qwal5wrb53if2wkwiuja43q
Modeling Hybrid Systems in Hy-tccp
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present hybrid tccp (hy-tccp), an extension of tccp over continuous time which includes new con- structs to model the continuous dynamics of hybrid systems. ...
The Timed Concurrent Constraint Language (tccp) was introduced as a simple but powerful model for reactive systems. ...
Furthermore, we plan to use model checking and abstract interpretation to verify temporal properties of hybrid systems written in hy-tccp (as done in [5] for SPIN). ...
arXiv:1412.4550v1
fatcat:5c7rnd2afvex3pdvgr735v5foe
Concurrent and Reactive Constraint Programming
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. ...
Concurrent constraint programming (ccp) presented two new perspectives on the underlying philosophy of logic programming. ...
The time and the semantic model of this extension follows the lines of the tccp language presented in Section 5. ...
doi:10.1007/978-3-642-14309-0_11
fatcat:jo4qnuehvfggfn3fkugqgmsqpu
« Previous
Showing results 1 — 15 out of 77 results