Abstract diagnosis for timed concurrent constraint programs

Comini, Marco; Titolo, Laura; Villanueva, Alicia

doi:10.1017/s1471068411000135

Cited by 13 publications

(20 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To mitigate this situation, we plan to provide tools for abstract debugging that allow the programmer to quickly find problems in her design before attempting the verification of more precise desirable properties. For that, we may rely on the abstract interpretation frameworks for the analysis of ccp programs that have been proposed in the literature (see e.g., [1,7,11,23]). Our idea is to use an abstraction of the constraint system in the lines of [11] in order to reduce the number of states generated by our technique.…”

Section: Discussionmentioning

confidence: 99%

A Symbolic Model for Timed Concurrent Constraint Programming

Arias

Guzmán

Olarte

2015

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our method.

show abstract

Section: Discussionmentioning

confidence: 99%

A Symbolic Model for Timed Concurrent Constraint Programming

Arias

Guzmán

Olarte

2015

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The language studied in (Comini et al 2011) corresponds to tccp (de Boer et al 2000), a temporal ccp language where the stores are monotonically accumulated along the time-units and whose operational semantics relies on the notion of true parallelism. We note that the framework developed in (Comini et al 2011) is used for abstract diagnosis rather than for general analyses.…”

Section: Discussionmentioning

confidence: 99%

Abstract interpretation of temporal concurrent constraint programs

Falaschi¹,

Olarte²,

Palamidessi³

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e. systems that continuously interact with the environment. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics for tcc, and we extend it to a "collecting" semantics for utcc based on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques. The concrete and abstract semantics we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis for tcc programs. We show the applicability of this analysis in the context of reactive systems. Furthermore, we make also use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show that tcc programs are suspension free. This can be useful for several purposes, such as for optimizing compilation or for debugging.

show abstract

“…However, for the tccp case, due to the strong synchronization of parallel processes, over-approximation of stores can lead to lose correctness [AGPV05]. Hence, similarly to [AGPV05,CTV11], given an abstract domain, we use two binary relations (an over-and an under-approximation relation) over the abstract domain to be able to conservatively approximate the operational behavior. For positive conditions we need to guarantee to preserve all consistent constraints (thus over-approximate) while dually, for negative conditions we cannot introduce solutions but possibly discard some (thus under-approximate).…”

Section: The (Finite) Abstract Semantics For Tccpmentioning

confidence: 99%

A program analysis framework for tccp based on abstract interpretation

et al. 2017

Self Cite

View full text Add to dashboard Cite

A program analysis framework for tccp based on abstract interpretation / Comini, Marco; Gallardo, María-del-Mar; Titolo, Laura; Villanueva, Alicia. Abstract. 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. In previous works, a semantic framework and abstract diagnosis method for the language have been defined. 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. The abstract semantics is correct and can be represented as a finite graph where each node represents a hypothetical (abstract) computational step of the program. The widening operator allows us to guarantee the convergence of the abstract fixpoint computation.

show abstract

Abstract diagnosis for timed concurrent constraint programs

Cited by 13 publications

References 11 publications

A Symbolic Model for Timed Concurrent Constraint Programming

A Symbolic Model for Timed Concurrent Constraint Programming

Abstract interpretation of temporal concurrent constraint programs

A program analysis framework for tccp based on abstract interpretation

Contact Info

Product

Resources

About