Transformations of CCP programs

Authors:
Sandro Etalle;Maurizio Gabbrielli;Maria Chiara Meo
Affiliations:
University of Twente and CWI, The Netherlands;Università di Bologna, Italy;Università di Chieti, Pescara, Italy
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
2001

Citing 21
Cited 11

Guarded horn clauses

Proceedings of the 4th conference on Logic programming '85
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Communication and concurrency

Communication and concurrency
Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A fully abstract model for concurrent constraint programming

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
A transformation system for deductive database modules with perfect model semantics

Theoretical Computer Science
Suspension analyses for concurrent logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Transformations of CLP modules

Theoretical Computer Science
Self-applicable partial evaluation for the pi-calculus

PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Partial-evaluation techniques for concurrent programs

PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Proving concurrent constraint programs correct

ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial evaluation of concurrent constraint languages

ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Transforming constraint logic programs

Theoretical Computer Science
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Derivation of Logic Programs

Journal of the ACM (JACM)
Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unfold/Fold Transformations of Concurrent Processes

PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Partial Evaluation Scheme for Concurrent Languages and Its Correctness

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Unfold/Fold Transformations of CCP Programs

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Concurrent constraint programming languages

Concurrent constraint programming languages

An unfold/fold transformation framework for definite logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination of simply moded logic programs with dynamic scheduling

ACM Transactions on Computational Logic (TOCL)
Infinite Unfolding and Transformations of Nondeterministic Programs

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Unfolding in CHR

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Transformations of logic programs on infinite lists

Theory and Practice of Logic Programming
Constraint logic programming

A 25-year perspective on logic programming
The transformational approach to program development

A 25-year perspective on logic programming
Concurrent and reactive constraint programming

A 25-year perspective on logic programming
Specialization of concurrent guarded multi-set transformation rules

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Infinite Unfolding and Transformations of Nondeterministic Programs

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations that guarantee the input/output CCP semantics is also preserved when distinguishing deadlocked computations from successful ones and when considering intermediate results of (possibly) nonterminating computations.The system allows us to optimize CCP programs while preserving their intended meaning: In addition to the usual benefits for sequential declarative languages, the transformation of concurrent programs can also lead to the elimination of communication channels and of synchronization points, to the transformation of nondeterministic computations into deterministic ones, and to the crucial saving of computational space. Furthermore, since the transformation system preserves the deadlock behavior of programs, it can be used for proving deadlock-freeness of a given program with respect to a class of queries. To this aim, it is sometimes sufficient to apply our transformations and to specialize the resulting program with respect to the given queries in such a way that the obtained program is trivially deadlock-free.