Loading...
Please wait, while we are loading the content...
Similar Documents
A Transformation System for CLP with Dynamic Scheduling and ccp (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Etalle, Sandro Marchiori, Elena Gabbrielli, Maurizio |
| Description | In Proc. of the ACM Sigplan PEPM’97 |
| Abstract | In this paper we study unfold/fold transformations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming (ccp). We define suitable applicability conditions for this transformations which ensure us that the original and the transformed program have the same results of successful computations and have the same deadlocked derivations. The possible applications of these results are twofold. On one hand we can use the unfold/fold system to optimize CLP and ccp programs while preserving their intended meaning and in particular without the risk of introducing deadlocks. On the other hand, unfold/fold transformations can be used for proving deadlock freedom for a class of queries in a given program: to this aim it is sufficient to specialize the program with respect to the given queries in such a way that the resulting program is trivially deadlock free. As shown by several interesting examples, this yields a methodology for proving deadlock free... |
| File Format | |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Deadlock Freedom Deadlocked Derivation Transformation System Possible Application Unfold Fold Transformation Unfold Fold System Transformed Program Ccp Program Several Interesting Example Suitable Applicability Condition Successful Computation Constraint Logic Program Dynamic Scheduling Concurrent Constraint Programming |
| Content Type | Text |
| Resource Type | Article |
