Nondeterminism and infinite computations in constraint programming

Boer, Frank S. de; Pierro, Alessandra Di; Palamidessi, Catuscia

doi:10.1016/0304-3975(95)00047-z

Cited by 52 publications

(56 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, similarly to tcc, completeness is verified only for the fragment of utcc where there are no occurrences of unless processes in the body of local processes. The reader may refer (de Boer et al 1995;Nielsen et al 2002a) for counterexamples showing that [ [P ]] ⊆ sp(P ) when P is not locally independent.…”

Section: Proofmentioning

confidence: 99%

“…The ideas of this paper stem mainly from the works of the authors in (de Boer et al 1995;Falaschi et al 1997a;Falaschi et al 1997b;Nielsen et al 2002a;Olarte and Valencia 2008a) to give semantic characterization of ccp calculi and from the works in (Falaschi et al 1993;Falaschi et al 1997a;Zaffanella et al 1997;Falaschi et al 2007) to provide abstract interpretation frameworks to analyze concurrent logic-based languages. A preliminary short version of this paper without proofs was published in (Falaschi et al 2009).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Abstract interpretation of temporal concurrent constraint programs

Falaschi¹,

Olarte²,

Palamidessi³

2014

Theory and Practice of Logic 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 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

Section: Proofmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Abstract interpretation of temporal concurrent constraint programs

Falaschi¹,

Olarte²,

Palamidessi³

2014

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

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%

Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Aristizábal

Bonchi

Palamidessi

et al. 2011

Foundations of Software Science and Computational Structures

Self Cite

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

“…Concurrent constraint programming traces its origins back to Montanari's pioneering work [26] leading to constraint programming and Shapiro's concurrent logic programming [45]. The ccp model has received a significant theoretical and implementational attention: Saraswat, Rinard and Panangaden [44] as well as De Boer, Di Pierro and Palamidessi [6] gave fixed-point denotational semantics to ccp whilst Montanari and Rossi [35] gave it a (true-concurrent) Petri-Net semantics; De Boer, Gabrielli et al [7] developed an inference system for proving properties of ccp processes; Smolka's Oz [47] as well as Haridi and Janson's AKL [17] programming languages are built upon ccp ideas. During computation, the state of the system is specified by an entity called the store where items of information about the variables of the system reside.…”

Section: Concurrent Constraint Programmingmentioning

confidence: 99%

Concurrency, Time, and Constraints

Valencia

2003

Logic Programming

View full text Add to dashboard Cite

Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in a shared medium. Timed (or temporal) ccp extends ccp by allowing agents to be constrained by time requirements. The novelty of timed ccp is that it combines in one framework an operational and algebraic view based upon process calculi with a declarative view based upon temporal logic. This allows the model to benefit from two well-established theories used in the study of concurrency. This essay offers an overview of timed ccp covering its basic background and central developments. The essay also includes an introduction to a temporal ccp formalism called the ntcc calculus.

show abstract

Nondeterminism and infinite computations in constraint programming

Cited by 52 publications

References 9 publications

Abstract interpretation of temporal concurrent constraint programs

Abstract interpretation of temporal concurrent constraint programs

Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Concurrency, Time, and Constraints

Contact Info

Product

Resources

About