Transformations of CCP programs

Share/Save/Bookmark

Etalle, Sandro and Gabbrielli, Maurizio and Meo, Maria Chiara (2001) Transformations of CCP programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 23 (3). pp. 304-395. ISSN 0164-0925

[img]PDF
Restricted to UT campus only
: Request a copy
828Kb
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.
Item Type:Article
Copyright:© 2001 ACM
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/55803
Official URL:http://dx.doi.org/10.1145/503502.503504
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page