The Replacement Operation for CCP Programs

Bertolino, Marco; Etalle, Sandro; Palamidessi, Catuscia

doi:10.1007/10720327_13

Cited by 4 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following the above line of research, [3] investigated transformation techniques based on the replacement. This is a powerful operation which can mimic the most common transformation operations such as unfold, fold, switching, distribution.…”

Section: Fold/unfold Transformations Of Ccpmentioning

confidence: 99%

Concurrent and Reactive Constraint Programming

Gabbrielli¹,

Palamidessi²,

Valencia³

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification, and timed extensions. In this paper we review the main lines of research and contributions of the community in this field. ([52, 56, 57]) emerged as one of the most successful proposals in this area. Concurrent constraint programming (ccp) presented two new perspectives on the underlying philosophy of logic programming. One is the replacement of the concept of unification over the Herbrand universe by the more general notion of constraint over an arbitrary domain. This is in a sense a 'natural' development, and the idea was already introduced in 'sequential' logic programming by Jaffar and Lassez ([45]). The other is the introduction of extra-logical operators typical of the imperative concurrent paradigms, like CCS ([47]), TCSP ([8]) and ACP ([1]); in particular, the choice (+), the action prefixing (→), and the hiding operator (∃). Additionally, concurrent constraint programming embodies an explicit characterization of the control mechanisms for communication and synchronization by means of the introduction of two kinds of actions (ask and tell). Also in concurrent logic languages these control features were present, but they were hidden in various ways: the choice was represented by alternative clauses, hiding by local (existentially quantified) variables, prefixing by commitment, communication by sharing of variables, and synchronization by restrictions on the unification algorithm.

show abstract

Section: Fold/unfold Transformations Of Ccpmentioning

confidence: 99%

Concurrent and Reactive Constraint Programming

Gabbrielli¹,

Palamidessi²,

Valencia³

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…This framework has found application for proving deadlock freeness of CCP programs. Furthermore, [21] investigated transformation techniques for CCP based on the replacement (see [163] for a survey of transformation techniques in logic languages). Abstract semantic characterizations for CCP have been studied in [79,213].…”

Section: Semantic Framework and Program Analysismentioning

confidence: 99%

Models and emerging trends of concurrent constraint programming

2013

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

Transformation Rules for Logic Programs with Goals as Arguments

Pettorossi

Proietti

2000

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

The Replacement Operation for CCP Programs

Cited by 4 publications

References 19 publications

Concurrent and Reactive Constraint Programming

Concurrent and Reactive Constraint Programming

Models and emerging trends of concurrent constraint programming

Transformation Rules for Logic Programs with Goals as Arguments

Contact Info

Product

Resources

About