Skip to Main content Skip to Navigation
Conference papers

A Framework for Abstract Interpretation of Timed Concurrent Constraint Programs

Abstract : 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 the first 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 w.r.t. 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, e.g., to perform 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 have developed a prototypical implementation of our methodology and we have implemented the abstract domain for security to perform automatically the secrecy analysis.
Document type :
Conference papers
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/inria-00426608
Contributor : Catuscia Palamidessi <>
Submitted on : Tuesday, October 27, 2009 - 1:15:01 AM
Last modification on : Friday, June 4, 2021 - 9:44:02 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 12:45:30 PM

File

ppdp21-olarte.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi. A Framework for Abstract Interpretation of Timed Concurrent Constraint Programs. PPDP 2009 - ACM SIGPLAN 11th Conference on Principles and practice of declarative programming, Sep 2009, Coimbra, Portugal. pp.207-218, ⟨10.1145/1599410.1599436⟩. ⟨inria-00426608⟩

Share

Metrics

Record views

594

Files downloads

503