The semantic foundations of concurrent constraint programming

Saraswat, Vijay; Rinard, Martin; Panangaden, Prakash

doi:10.1145/99583.99627

Cited by 275 publications

(330 citation statements)

References 23 publications

Supporting

Mentioning

329

Contrasting

Unclassified

Order By: Relevance

“…Following standard lines [16,12], we replace the classical hiding operator ∃ x A with ∃ x,c A that represents the evolution of a process of the form ∃ x A , where c is the local constraint produced during the evolution. Moreover, p(ỹ) is a procedure call, where p is the name of the procedure andỹ is the tuple of actual parameters.…”

Section: Definitionmentioning

confidence: 99%

CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements

Buscemi

Montanari

2007

Programming Languages and Systems

110

106

View full text Add to dashboard Cite

Abstract. Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost, performance, availability, etc.). In this work we propose a simple model of contracts for QoS and SLAs that also allows to study mechanisms for resource allocation and for joining different SLA requirements. Our language combines two basic programming paradigms: name-passing calculi and concurrent constraint programming (cc programming). Specifically, we extend cc programming by adding synchronous communication and by providing a treatment of names in terms of restriction and structural axioms closer to nominal calculi than to variables with existential quantification. In the resulting framework, SLA requirements are constraints that can be generated either by a single party or by the synchronisation of two agents. Moreover, restricting the scope of names allows for local stores of constraints, which may become global as a consequence of synchronisations. Our approach relies on a system of named constraints that equip classical constraints with a suitable algebraic structure providing a richer mechanism of constraint combination. We give reductionpreserving translations of both cc programming and the calculus of explicit fusions.

show abstract

Section: Definitionmentioning

confidence: 99%

CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements

Buscemi

Montanari

2007

Programming Languages and Systems

110

106

View full text Add to dashboard Cite

show abstract

“…Analogous concurrency constructions were suggested for other (constraint) logic programming languages, e.g. [12].…”

Section: Introductionmentioning

confidence: 91%

Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis

Frühwirth

2005

Logic Programming

View full text Add to dashboard Cite

Abstract. Constraint Handling Rules is a logical concurrent committedchoice rule-based language. Recently it was shown that the classical union-find algorithm can be implemented in CHR with optimal time complexity. Here we investigate if a parallel implementation of this algorithm is also possible in CHR. The problem is hard for several reasons: -Up to now, no parallel computation model for CHR was defined. -Tarjan's optimal union-find is known to be hard to parallelize. -The parallel code should be as close as possible to the sequential one. It turns out that confluence analysis of the sequential implementation gives almost all the information needed to parallelize the union-find algorithm under a rather general parallel computation model for CHR.

show abstract

“…Following [27,10], we regard a constraint system as a complete algebraic lattice structure in which the ordering is the reverse of an entailment relation (c d means that d contains "more information" than c, hence c can be derived from d). The top element false represents inconsistency, the bottom element true is the empty constraint, and the least upper bound (lub) represents the join of information.…”

Section: Constraint Systemsmentioning

confidence: 99%

“…In order to model hiding of local variables and parameter passing, in [27] the notion of constraint system is enriched with cylindrification operators and diagonal elements, concepts borrowed from the theory of cylindric algebras (see [14]). …”

Section: Definitionmentioning

confidence: 99%

See 1 more Smart Citation

Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Aristizábal

Bonchi

Palamidessi

et al. 2011

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. Concurrent constraint programming (ccp) is a well-established model for concurrency. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled transition semantics and a novel notion of bisimilarity that is fully abstract w.r.t. the typical observational equivalence in ccp.

show abstract

The semantic foundations of concurrent constraint programming

Cited by 275 publications

References 23 publications

CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements

CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements

Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis

Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Contact Info

Product

Resources

About