DMCA
Unfold/fold transformations of CCP programs (1998)
Cached
Download Links
| Venue: | ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS |
| Citations: | 19 - 5 self |
BibTeX
@INPROCEEDINGS{Etalle98unfold/foldtransformations,
author = {Sandro Etalle and Maurizio Gabbrielli and Maria Chiara Meo},
title = {Unfold/fold transformations of CCP programs},
booktitle = {ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS},
year = {1998},
pages = {348--363},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input/output CCP semantics is preserved also when distinguishing deadlocked computations from successful ones and when considering intermediate results of (possibly) non-terminating computations. The system allows us to optimize CCP programs while preserving their intended meaning: In addition to the usual benefits that one has 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 non-deterministic 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.
Keyphrases
ccp program unfold fold transformation transformation system successful one deadlock freeness concurrent constraint programming communication channel intermediate result deterministic one intended meaning deadlock behavior non-deterministic computation synchronization point suitable applicability condition computational space usual benefit non-terminating computation concurrent program sequential declarative language obtained program input output ccp semantics crucial saving
