Towards a Unified Framework for Declarative Structured Communications

López, Hugo A.; Olarte, Carlos; Pérez, Jorge A.

doi:10.4204/eptcs.17.1

Cited by 9 publications

(27 citation statements)

References 22 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[15,16]. As future work, it would be interesting to see if it is possible to carry out similar analyses in our framework for suitable fragments of π that can be encoded into utcc (see e.g., [19] that encodes a π-based language for structured communication into utcc).…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A framework for abstract interpretation of timed concurrent constraint programs

Falaschi

Olarte

Palamidessi

2009

Proceedings of the 11th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Self Cite

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 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

show abstract

Section: Discussionmentioning

confidence: 99%

“…For instance, it was shown to be enough to encode Turing-powerful formalisms in [26]. It has also found application, e.g., in multimedia interaction systems [24] and declarative interpretation of languages for structured communications [19].…”

Section: Semantic Correspondencementioning

confidence: 99%

A framework for abstract interpretation of timed concurrent constraint programs

Falaschi

Olarte

Palamidessi

2009

Proceedings of the 11th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…In a previous work [20] we described a first step towards such a unified account of operational and declarative approaches. We gave an encoding of the session π-calculus in [17] as declarative processes in universal concurrent constraint programming (utcc) [26].…”

Section: Introductionmentioning

confidence: 98%

Declarative interpretations of session-based concurrency

Cano

Rueda

López

et al. 2015

Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured; the latter defines governing conditions. In this paper, we investigate the relationship between operational and declarative models of session-based concurrency. We propose two interpretations of session π-calculus processes as declarative processes in linear concurrent constraint programming (lcc). They offer a basis on which both operational and declarative requirements can be specified and reasoned about. By coupling our interpretations with a type system for lcc, we obtain robust declarative encodings of π-calculus mobility.

show abstract

“…Type rules statically ensure that a predefined communication scheme/protocol (typically based on duality) is respected along process execution. The work in [133] studies an encoding of the language for structured communications proposed in [115] into utcc. The framework allows for the declarative analysis of sessions in network protocols.…”

Section: Security and Service Oriented Computingmentioning

confidence: 99%

Models and emerging trends of concurrent constraint programming

2013

Self Cite

View full text Add to dashboard Cite

Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a vast variety of systems as those arising in biological phenomena, reactive systems, netcentric computing and the advent of social networks and cloud computing. In this paper we survey the main applications, developments and current trends of CCP.

show abstract

Towards a Unified Framework for Declarative Structured Communications

Cited by 9 publications

References 22 publications

A framework for abstract interpretation of timed concurrent constraint programs

A framework for abstract interpretation of timed concurrent constraint programs

Declarative interpretations of session-based concurrency

Models and emerging trends of concurrent constraint programming

Contact Info

Product

Resources

About