A transformation system for CLP with dynamic scheduling and CCP

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 1997, Pages 137-150

  Etalle, Sandro ^a   Gabbrielli, Maurizio ^b   Marchiori, Elena ^c  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITY OF PISA   (Italy)

^c CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Concurrent constraint logic programming; Coroutining; Deadlock; Transformation

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; SCHEDULING; SEMANTICS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; ERRORS; FORMAL LOGIC; MATHEMATICAL MODELS; OPTIMIZATION;

CONCURRENT CONSTRAINT; CONCURRENT CONSTRAINT PROGRAMMING; CONSTRAINT LOGIC PROGRAMS; COROUTINING; DEADLOCK; DYNAMIC SCHEDULING; TRANSFORMATION; TRANSFORMATION SYSTEMS;

LOGIC PROGRAMMING;

CONCURRENT CONSTRAINT PROGRAMMING; CONSTRAINT LOGIC PROGRAM; COROUTINING; DEADLOCK; TRANSFORMATION;

EID: 0030681872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258993.259014     Document Type: Conference Paper

References (36)

1. K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology, (AMAST'95), Lecture Notes in Computer Science, Berlin, 1995. Springer-Verlag.
2. N. Bensaou and I. Guessarian. Transforming Constraint Logic Programs. In F. Turini, editor, Proc. Fourth Workshop on Logic Program Synthesis and Transformation, 1994.
3. R.M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(l):44-67, January 1977.
4. P. Chambre, P. Deransart, and J. Małuszyński. A proof method for safety properties of clausal concurrent constraint programs. In F. de Boer and M. Gabbrielli, editors, Proc. JICSLP'96 Post-Conference Workshop on Verification and Analysis of Logic Programs, 1996. Technical Report TR-96-31, Dipartimento di Informatica di Pisa.
5. K.L. Clark and S. Sickel. Predicate logic: a calculus for deriving programs. In Proceedings of IJCAI'77, pages 419-120, 1977.
6. M. Codish, M. Falaschi, and K. Marriott. Suspension Analyses for Concurrent Logic Programs. ACM Transactions on Programming Languages and Systems 16(3):649-686, 1994.
7. C. Codognet, P. Codognet, and M. Corsini. Abstract Interpretation for Concurrent Logic Languages. In S. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming'90, pages 215-232. MIT Press, 1990.
8. F.S. de Boer, M. Gabbrielli, and C. Palamidessi. Proving correctness of constraint logic programs with dynamic scheduling. In Static Analysis, Third International Static Analysis Symposium, (SAS'96), LNCS. Springer-Verlag, Berlin, 1996.
9. M. Garcia de la Banda, K. Marriott, and P. Stuckey. Efficient analysis of logic programs with dynamic scheduling. In J. Lloyd, editor, Proc. Twelfth International Logic Programming Symposium, pages 417-431. MIT Press, 1995.
10. S. Debray, D. Gudemann, and P. Bigot. Detection and optimization of suspension-free logic programs. In M. Bruynooghe, editor, Proc. Eleventh International Logic Programming Symposium, pages 487-504. MIT Press, 1994.
11. S. Etalle and M. Gabbrielli. The replacement operation for CLP modules. In N. Jones, editor, A CM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '95), pages 168-177. ACM press, 1995.
12. S. Etalle and M. Gabbrielli. Layered modes. In F. de Boer and M. Gabbrielli, editors, Proc. JICSLP'96 Post-Conference Workshop on Verification and Analysis of Logic Programs 1996. Tehcnical Report TR-96-31, Dipartimento di Informatica di Pisa.
13. S. Etalle and M. Gabbrielli. Transformations of CLP modules. Theoretical Computer Science 166(1):101-146, 1996.
14. N. De Francesco and A. Santone. Unfold/fold transformation of concurrent processes. In H. Kuchen and S. Doaitse Swierstra, editors, Proc. 8th Int'l Symp. on Programming Languages: Implementations, Logics and Programs, Volume 1140, pages 167-181. Springer-Verlag, 1996.
15. Nevin Heintze, Spiro Michaylov, and Peter J. Stuckey. CLP(R) and some electrical engineering problems. In Jean-Louis Lassez, editor, ICLP'87: Proceedings 4th International Conference on Logic Programming, pages 675-703, Melbourne, Victoria, Australia, May 1987. MIT Press
16. Also in Journal of Automated Reasoning Vol. 9, pages 231-260, October 1992.
17. C.J. Hogger. Derivation of logic programs. Journal of the ACM, 28(2):372-392, April 1981.
18. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111-119. ACM, 1987.
19. J. Jaffar, S. Michaylov, and P. Stuckey. The clp(V) language and system. ACM Transactions on Programming Languages and Systems 14(3):339-395, July 1992.
20. Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19/20: 503-581, 1994.
21. H. Komorowski. Partial evaluation as a means for in-ferencing data structures in an applicative language: A theory and implementation in the case of Prolog. In Ninth ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, pages 255-267. ACM, 1982.
22. A. Lakhotia and L. Sterling. Composing recursive logic programs with clausal join. New Generation Computing 6(2,3):211-225, 1988.
23. C. Lassez, K. McAloon, and R. Yap. Constraint Logic Programming and Option Trading. IEEE Expert 2(3), 1987.
24. M. J. Maher. A CLP view of Logic Programming. In H. Kirchner and G. Levi, editors, Proc. of the Third Int'l Conf. on Algebraic and Logic Programming, Volume 6 of Lecture Notes in Computer Science pages 364-383. Springer-Verlag, Berlin, 1992.
25. M.J. Maher. A transformation system for deductive databases with perfect model semantics. Theoretical Computer Science, 110(2):377-403, March 1993.
26. E. Marchiori and F. Teusink. Proving termination of logic programs with delay declarations. In J. Lloyd, editor, Proc. Twelfth International Logic Programming Symposium. MIT Press, 1995.
27. K. Marriott, M. Garcia de la Banda, and M. Hermenegildo. Analyzing logic programs with dynamic scheduling. In Proc. 21st Annual ACM Symp. on Principles of Programming Languages pages 240-253. ACM Press, 1994.
28. L. Naish. An introduction to mu-prolog. Technical Report 82/2, The University of Melbourne, 1982.
29. A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19, 20:261-320, 1994.
30. D. Sahlin. Partial Evaluation of AKL. In Proceedings of the First International Conference on Concurrent Constraint Programming, 1995.
31. V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Proc. Eighteenth Annual ACM Symp. on Principles of Programming Languages. ACM Press, 1991.
32. V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of the Seventeenth ACM Symposium on Principles of Programming Languages pages 232-245. ACM, New York, 1990.
33. H. Tamaki and T. Sato. Unfold/Fold Transformations of Logic Programs. In Sten-Åke Tärnlund, editor, Proc. Second Int'l Conf. on Logic Programming, pages 127-139, 1984.
34. K. Ueda and K. Furukawa. Transformation rules for GHC Programs. In Proc. Int'l Conf. on Fifth Generation Computer Systems pages 582-591. Institute for New Generation Computer Technology, Tokyo, 1988.
35. M.H. van Emden and G.J. de Lucena. Predicate logic as a language for parallel programming. In K.L. Clark and S.-A. Tärnlund, editors, Logic Programming, London, 1982. Academic Press.
36. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, 1989.