Temporal Concurrent Constraint Programming: Applications and Behavior

Nielsen, Mogens; Valencia, Frank

doi:10.7146/brics.v8i48.21708

Cited by 31 publications

(80 citation statements)

References 20 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we first describe the temporal concurrent constraint (tcc) model (24) following the presentation in (22). We then recall the universal tcc model (utcc) introduced in (23).…”

Section: Universal Timed Ccpmentioning

confidence: 99%

“…The other rules are standard, easily seen to realize the operational intuitions given above (see (22) for further details). As clarified below, the seemingly missing rules for "next" and "unless" processes are given by RO.…”

Section: An Operational Semantics For Utccmentioning

confidence: 99%

“…Here we only outline the main steps of the abstraction case P = (abs x; c) Q -the other cases proceed as in (22). As a mean of contradiction assume that w ∈ sps (P ) and w / ∈ [[P ]].…”

Section: Theorem 5 (Soundness) Given An Abstracted-unless Free Procementioning

confidence: 99%

“…For completeness we have similar technical problems that in the case of tcc (22) namely: the combination between the local and the "unless" operator-see (22) for details. Thus as in (22) the full abstraction is achieved only for the locally independent fragment. DEFINITION 19 (Locally Independent Processes).…”

Section: Theorem 5 (Soundness) Given An Abstracted-unless Free Procementioning

confidence: 99%

See 3 more Smart Citations

The expressivity of universal timed CCP

Olarte

Valencia

2008

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

Self Cite

View full text Add to dashboard Cite

The timed concurrent constraint programing model (tcc) is a declarative framework, closely related to First-Order Linear Temporal Logic (FLTL), for modeling reactive systems. 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.This paper is devoted to the study of 1) the expressiveness of utcc and 2) its semantic foundations. As applications of this study, we also state 3) a noteworthy decidability result for the wellestablished framework of FLTL and 4) bring new semantic insights into the modeling of security protocols.More precisely, we show that in contrast to tcc, utcc is Turingpowerful by encoding Minsky machines. The encoding uses a monadic constraint system allowing us to prove a new result for a fragment of FLTL: The undecidability of the validity problem for monadic FLTL without equality and function symbols. This result refutes a decidability conjecture for FLTL from a previous paper. It also justifies the restriction imposed in previous decidability results on the quantification of flexible-variables.We shall also show that as in tcc, utcc processes can be semantically represented as partial closure operators. The representation is fully abstract wrt the input-output behavior of processes for a meaningful fragment of the utcc. This shows that mobility can be captured as closure operators over an underlying constraint system. As an application we identify a language for security protocols that can be represented as closure operators over a cryptographic constraint system.

show abstract

“…In this section we first describe the temporal concurrent constraint (tcc) model (24) following the presentation in (22). We then recall the universal tcc model (utcc) introduced in (23).…”

Section: Universal Timed Ccpmentioning

confidence: 99%

Section: An Operational Semantics For Utccmentioning

confidence: 99%

“…Here we only outline the main steps of the abstraction case P = (abs x; c) Q -the other cases proceed as in (22). As a mean of contradiction assume that w ∈ sps (P ) and w / ∈ [[P ]].…”

Section: Theorem 5 (Soundness) Given An Abstracted-unless Free Procementioning

confidence: 99%

Section: Theorem 5 (Soundness) Given An Abstracted-unless Free Procementioning

confidence: 99%

See 2 more Smart Citations

The expressivity of universal timed CCP

Olarte

Valencia

2008

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

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our definitions are inspired by similar studies for the timed cc languages [29]. However, our approach is tuned to the current setup and is intentionally more syntactic to enable coinductive proofs directly on policies as they execute.…”

Section: Equational Reasoningmentioning

confidence: 99%

Timed constraint programming

Jagadeesan

Marrero

Pitcher

et al. 2005

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

View full text Add to dashboard Cite

This paper focuses on policy languages for (role-based) access control [14,32], especially in their modern incarnations in the form of trust-management systems [9] and usage control [30,31]. Any (declarative) approach to access control and trust management has to address the following issues:• Explicit denial, inheritance, and overriding, and• History-sensitive access control Our main contribution is a policy algebra, in the timed concurrent constraint programming paradigm, that uses a form of default constraint programming to address the first issue, and reactive computing to address the second issue.The policy algebra is declarative -programs can be viewed as imposing temporal constraints on the evolution of the system -and supports equational reasoning. The validity of equations is established by coinductive proofs based on an operational semantics.The design of the policy algebra supports reasoning about policies by a systematic combination of constraint reasoning and model checking techniques based on linear time temporal-logic. Our framework permits us to perform security analysis with dynamic state-dependent restrictions.

show abstract