S. Etalle, M. Gabbrielli, and M. C. Meo. Unfold/fold transformations of CCP programs. In D. Sangiorgi and R. de Simone, editors, Proceedings of the International Conference on Concurrency Theory, Concur98, Lecture Notes in Computer Science 1466, pages 348363, 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... (see [14, 39, 77, 92, 100, 105, 123] The transformational approach has also been considered in the case of various extensions of de nite logic programs, such as logic programs with negation (see Section 5) constraint logic programs [8, 64, 106] and concurrent constraint programs [65, 148]. General methods for proving the correctness of transformation rules are studied in [133] for the case of higher order functional languages, and [126] for programming languages whose semantics is speci ed by inductive de nitions, like that of Section 2.4. 16 3 Strategies for Transforming ....

S. Etalle, M. Gabbrielli, and M. C. Meo. Unfold/fold transformations of CCP programs. In D. Sangiorgi and R. de Simone, editors, Proceedings of the International Conference on Concurrency Theory, Concur98, Lecture Notes in Computer Science 1466, pages 348363, 1998.

....with respect to the measure structures as well as semantics. In future, it would be interesting to study whether we can develop similar parameterized unfold fold transformation frameworks for other programming paradigms such as functional and concurrent constraint programming languages [EGM98, San96] as well as process algebraic speci cation languages (e.g. CCS) FS98] 27 Chapter 3 Extending our transformations to normal logic programs 3.1 Background Normal logic programs consist of de nitions of the form A : where A is an atom and is a boolean formula over atoms. ....

S. Etalle, M. Gabrielli, and M.C. Meo. Unfold/fold transformations of CCP programs. In R. De Simone and D. Sangiorgi, editors, CONCUR '98, volume 1466 of Lecture Notes in Computer Science, Nice, September 1998. Springer-Verlag.

....of programs. Observables are then a suitable abstraction of execution traces. In case of equivalence based on operational semantics expressed by a transition system, it is common to define as observables the results of finite computations, where one abstracts away local variables, see e.g. [EGM98]. We have already shown in previous work [Abd97] that analysis techniques are available for an important property of any constraint solver, namely confluence: The result of a computation should be independent from the order in which constraints arrive and in which rules are applied to the ....

S. Etalle, M. Gabrielli, and M. Meo. Unfold/fold transformations of CCP programs. In 9th International Conference on Concurrency Theory, 1998. Corrected version.

....with respect to the measure structures as well as semantics. In future, it would be interesting to study whether we can develop similar parameterized unfold fold transformation frameworks for other programming paradigms such as functional and concurrent constraint programming languages [5, 17] as well as process algebraic specification languages (e.g. CCS) 6] Acknowledgements: We would like to thank the anonymous referees for their valuable comments. We thank Alberto Pettorossi and Maurizio Proietti for useful discussions and pointers to earlier work. We also thank Sandro Etalle for ....

S. Etalle, M. Gabrielli, and M.C. Meo. Unfold/fold transformations of CCP programs. In Proceedings of CONCUR, 1998.

....while Section 5 contains the results for non terminating computations (some of the proofs are deferred to the Appendix) Further examples are contained in Section 6. Section 7 concludes by comparing this paper to related work in the literature. A preliminary version of this paper appeared in [EGM98]. 2 Preliminaries The basic idea underlying the CCP paradigm is that computation progresses via monotonic accumulation of information in a global store. The information is produced (in form of constraints) by the concurrent and asynchronous activity of several agents which can add a constraint c ....

....computations only (possibly with no output) In fact, also in this case we need conditions (a) and (b) since otherwise bringing A inside the choice might transform a looping program into a deadlocking one. The above applicability conditions are a strict improvement on the ones we presented in [EGM98], in which we used the concept of required variable. We now report this de nition, both for simplifying the explanation for some examples and for comparing the above de nition of distribution with the one in [EGM98] De nition 3.11 (Required Variable) We say that the process D:A requires the ....

[Article contains additional citation context not shown here]

S. Etalle, M. Gabbrielli, and M. C. Meo. Unfold/Fold Transformations of CCP Programs. In D. Sangiorgi and R. de Simone, editors, CONCUR98 - 1998 International Conference on Concurrency Theory, LNCS 1466, pages 348-363. Springer-Verlag, 1998.

....and a wide literature on transformations for sequential languages, ranging from theoretical studies to implemented tools, there are only few and relatively recent attempts to apply these techniques to concurrent languages. To the best of our knowledge, the only papers addressing this issue are [10, 11, 29, 23, 14, 17, 13, 9]. In our opinion, this situation can be ascribed to the non determinism and the synchronization mechanisms present in concurrent languages, which substantially complicate their semantics. In this context, transformation techniques have to employ more sophisticated analysis tools. The area closest ....

.... on the manipulation of the constraint for compile time [18, 19] and for low level local optimization [15] On the other hand there are techniques such as the unfold fold transformation systems, which were developed initially for Logic Programs [28] and then applied to CLP [16, 1, 8] and to ccp in [9]. These ones focus primarily on the declarative side of the program. The Replacement is a program transformation technique exible enough to encompass both the above kinds of optimization: it can be pro tably used to manipulate both the constraint and the declarative side of a program. In fact ....

[Article contains additional citation context not shown here]

S. Etalle, M. Gabbrielli, and M. C. Meo. Unfold/Fold Transformations of CCP Programs. In D. Sangiorgi and R. de Simone, editors, CONCUR98 - 1998 International Conference on Concurrency Theory, LNCS 1466, pages 348-363. Springer-Verlag, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC