Proving Concurrent Constraint Programs Correct

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 5, 1997, Pages 685-725

  De Boer, Frank S ^a   Gabbrielli, Maurizio ^b   Marchiori, Elena ^d   Palamidessi, Catuscia ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF GENOA   (Italy)

^d NONE

Author keywords

D.1.3 Programming Techniques : Concurrent Programming; D.3.1 Programming Languages : Formal Definitions and Theory semantics; F.3.1 Logics and Meanings of Programs : Specifying and Verifying and Reasoning about Programs logics of programs

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; LOGIC PROGRAMMING; THEOREM PROVING;

CONCURRENT CONSTRAINT PROGRAMS (CCP);

MULTIPROCESSING PROGRAMS;

EID: 0031220274     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/265943.265954     Document Type: Article

References (45)

1. APT, K. 1983. Formal justification of a proof system for communicating sequential processes. J. ACM 30, 197-216.
2. APT, K., FRANCEZ, N., AND DE ROEVER, W. P. 1980. A proof system for communicating sequential processes. ACM Trans. Program. Lang. Syst. 1, 2, 359-385.
3. APT, K. R. 1990. Introduction to logic programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., Vol. B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 495-574.
4. APT, K. R. 1993. Declarative programming in Prolog. In Proceedings of the International Symposium on Logic Programming, D. Miller, Ed. The MIT Press, Cambridge, Mass.
5. APT, K. R. AND LUITJES, I. 1995. Verification of logic programs with delay declarations. In Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology (AMAST'95), A. Borzyszkowski and S. Sokolowski, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin.
6. ARBAB, B. AND BERRY, D. 1987. Operational and denotational semantics of Prolog. J. Logic Program. 4, 309-330.
7. BERGSTRA, J. AND KLOP, J. 1986. Conditional rewrite rules: Confluence and termination. J. Comput. Syst. Sci. 32, 323-362.
8. CARLSSON, M. 1988. SICStus Prolog user's manual. Tech. Rep., Swedish Institute of Computer Science, Sweden. URL: http://www.sics.se/isl/sicstus.html.
9. CODISH, M., FALASCHI, M., MARRIOTT, K., AND WINSBOROUGH, W. 1993. Efficient analysis of concurrent constraint logic programs. In Proceedings of the 20th International Colloquium on Automata, Languages, and Programming, A. Lingas, R. Karlsson, and S. Carlsson, Eds. Lecture Notes in Computer Science, Vol. 700. Springer-Verlag, Berlin, 633-644.
10. COLUSSI, L. AND MARCHIORI, E. 1991. Proving correctness of logic programs using axiomatic semantics. In Proceedings of the 8th International Conference on Logic Programming, K. Furukawa, Ed. The MIT Press, Cambridge, Mass., 629-644.
11. COLUSSI, L., MARCHIORI, E., AND MARCHIORI, M. 1995. A dataflow semantics for constraint logic programs. In Proceedings of the 7th International Symposium on Programming Languages, Implementations, Logics and Programs, M. Hermenegildo and S. D. Swierstra, Eds. Springer Verlag.
12. COOK, S. 1978. Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7, 1, 70-90.
13. DE BOER, F. AND PALAMIDESSI, C. 1992. A process algebra for concurrent constraint programming. In Proceedings of the Joint International Conference and Symposium on Logic Programming, K. Apt, Ed. Series in Logic Programming. The MIT Press, Cambridge, Mass, 463-477.
14. DE BOER, F. S. AND PALAMIDESSI, C. 1990. A fully abstract model of concurrent logic languages. Tech. Rep., Dipartimento di Informatica, Università di Pisa.
15. DE BOER, F. S., DI PIERRO, A., AND PALAMIDESSI, C. 1995. Infinite computations in nondeterministic constraint programming. Theor. Comput. Sci. 151, 37-78.
16. DE BOER, F. S., KOK, J. N., PALAMIDESSI, C., AND RUTTEN, J. J. M. M. 1991. The failure of failures: Towards a paradigm for asynchronous communication. In Proceedings of Concur '91. Lecture Notes in Computer Science, Vol. 527. Springer-Verlag, Berlin.
17. DIJKSTRA, E. 1976. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J.
18. FALASCHI, M., GABBRIELLI, M., MARRIOTT, K., AND PALAMIDESSI, C. 1993. Compositional analysis for concurrent constraint programming. In Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 210-221.
19. FALASCHI, M., GABBRIELLI, M., MARRIOTT, K., AND PALAMIDESSI, C. 1996a. Confluence in concurrent constraint programming. Tech. Rep. 96/284, Dept. of Computer Science, Monash University, Australia. To appear in Theoretical Computer Science.
20. FALASCHI, M., GABBRIELLI, M., MARRIOTT, K., AND PALAMIDESSI, C. 1996b. Constraint logic programming with dynamic scheduling: A semantics based on closure operators. Tech. Rep. 32/96, Dipartimento di Informatica, Univ. di Udine, Italy/ To appear in Information and Computation.
21. FOSTER, I. AND TAYLOR, S. 1989. Strand: New Concepts in Parallel Programming. Prentice Hall, Englewood Cliffs, N.J.
22. HENKIN, L., MONK, J., AND TARSKI, A. 1971. Cylindric Algebras. Part I and II. North-Holland, Amsterdam.
23. HILL, P. M. AND LLOYD, J. W. 1994. The Gödel Programming Language. The MIT Press, Cambridge, Mass.
24. HOARE, C. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10, 576-580.
25. JAFFAR, J. AND LASSEZ, J.-L. 1987. Constraint logic programming. In Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, 111-119.
26. JAFFAR, J. AND MAHER, M. J. 1994. Constraint logic programming: A survey. J. Logic Program. 19/20, 503-581.
27. JAFFAR, J., MICHAYOV, S., STUCKEY, P. J., AND YAP, R. H. C. 1992. The CLP(R) language and system. ACM Trans. Program. Lang. Syst. 14, 3 (July), 339-395.
28. JAGADEESAN, R., SHANBHOGUE, V., AND SARASWAT, V. 1991. Angelic non-determinism in concurrent constraint programming. Tech. Rep., System Science Lab., Xerox PARC, Palo Alto, Calif.
29. LÜTTRINGHAUS-KAPPEL, S. 1993. Control generation for logic programs. In Proceedings of the 10th International Conference on Logic Programming, D. Warren, Ed. MIT Press, Cambridge, Mass., 478-495.
30. MARCHIORI, E. AND TEUSINK, F. 1995. Proving termination of logic programs with delay declarations. In Proceedings of the 12th International Logic Programming Symposium, J. Lloyd, Ed. MIT Press, Cambridge, Mass.
31. MARRIOTT, K., DE LA BANDA, M. G., AND HERMENEGILDO, M. 1994. Analyzing logic programs with dynamic scheduling. In Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, 240-253.
32. NAISH, L. 1982. An introduction to mu-prolog. Tech. Rep. 82/2, The Univ. of Melbourne, Melbourne, Australia.
33. NAISH, L. 1986. Negation and Control in Prolog. Lecture Notes in Computer Science, Vol. 238. Springer-Verlag, Berlin.
34. OLDEROG, E. 1991. Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science, Vol. 23. Cambridge University Press, UK.
35. OWICKI, S. AND GRIES, D. 1976. An axiomatic proof technique for parallel programs. Acta Inf. 6, 319-340.
36. PANANGADEN, P. AND SHANBHOGUE, V. 1992. The expressive power of indeterminate dataflow primitives. Inf. Comput. 98, 1, 99-131, 1992.
37. PANANGADEN, P., SARASWAT, V., SCOTT, P., AND SEELY, R. 1992. A hyperdoctrinal view of concurrent constraint programming. In In Proceedings of the REX Workshop. Lecture Notes in Computer Science, Vol. 666. Springer-Verlag, Berlin, 457-476.
38. PLOTKIN, G. 1980. Dijkstra's predicate transformers and Smyth's powerdomains. Lecture Notes in Computer Science, D. Bjørner, Ed., Vol. 86. Springer-Verlag, Berlin.
39. ROBINSON, E. 1987. Logical aspects of denotational semantics. Lecture Notes in Computer Science, D.H. Pitt, A. Poigné, and D.E. Rydeheard, Eds., Vol. 283. Springer-Verlag, Berlin.
40. SARASWAT, V. AND RINARD, M. 1990. Concurrent constraint programming. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages. ACM Press, New York, 232-245.
41. SARASWAT, V. A. 1989. Concurrent constraint programming languages. Ph.D. thesis, Carnegie-Mellon Univ., Pittsburgh, Pa. Also in ACM distinguished dissertation series. The MIT Press, 1993.
42. SARASWAT, V. A., RINARD, M., AND PANANGADEN, P. 1991. Semantic foundation of concurrent constraint programming. In Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, 333-353.
43. SCOTT, D. 1982. Domains for denotational semantics. In Proceedings of the 9th International Conference on Automata, Languages and Programming, M. Nielsen and E. M. Schmidt, Eds. Lecture Notes in Computer Science, Vol. 140. Springer-Verlag, Berlin, 577-613.
44. SMYTH, M. 1983. Powerdomains and predicate transformers: A topological view. In Proceedings of the International Conference on Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 154. Springer-Verlag, Berlin, 662-675.
45. WALLACE, M. AND VERON, A. 1993. Two problems - two solutions: One system - ECLiPSe. In Proceedings of the IEEE Colloquium on Advanced Software Technologies for Scheduling.