Set-based failure analysis for logic programs and concurrent constraint programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1576, Issue , 1999, Pages 177-192

  Podelski, Andreas ^a   Charatonik, Witold ^a,c   Müller, Martin ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c University of Wroc law   (Poland)

Author keywords

Abstract interpretation; Concurrent constraint programs; Fairness; Finite failure; Logic programs; Set based program analysis; Types

Indexed keywords

EID: 84957886928     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49099-X_12     Document Type: Conference Paper

References (37)

1. A. Aiken. Set constraints: Results, applications and future directions. In Pro-ceedings of the Workshop on Principles and Practice of Constraint Programming, LNCS 874, pages 326-335. Springer-Verlag, 1994.
2. H. Aït-Kaci and A. Podelski. Functions as passive constraints in LIFE. ACM Transactions on Programming Languages and Systems (TOPLAS), 16 (3):1-40, 1994.
3. F. Bourdoncle. Abstract debugging of higher-order imperative languages. In Pro-ceedings of the SIGPLAN'93 Conference on Programming Language Design and Implementation (PLDI'93), pages 46-55. ACM Press, 1993.
4. W. Charatonik and A. Podelski. Co-definite set constraints. In T. Nipkow, editor, 9th International Conference on Rewriting Techniques and Applications, pages 211-225, Springer-Verlag. 1998.
5. W. Charatonik and A. Podelski. Directional Type Inference for Logic Programs. In G. Levi, editor, Proceedings of the International Symposium on Static Analysis. LNCS, pages 278-294, Springer-Verlag. 1998.
6. W. Charatonik, D. McAllester, D. Niwiński, A. Podelski and I. Walukiewicz. The Horn Mu-calculus. In V. Pratt, editor, Proceedings of the 12th Annual IEEE Sym-posium on Logic in Computer Science, pages 58-69, IEEE Press. 1998.
7. W. Charatonik and A. Podelski. Set-based Analysis of Reactive Infinite-state Systems. In B. Steffen, editor, Proceedings of the First International Conference on Tools and Algorithms for the Construction and Analysis of Systems. LNCS 1384, pages 358-375, Springer-Verlag. 1998.
8. W. Charatonik and A. Podelski. Set constraints for greatest models. Technical Report MPI-I-97-2-004, Max-Planck-Institut für Informatik. 1997.
9. W. Charatonik and A. Podelski. Set constraints with intersection. In G. Winskel, editor, Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 362-372, IEEE Press. 1997.
10. K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293-322. Plenum Press, 1978.
11. P. Cousot and R. Cousot. Inductive de_nitions, semantics and abstract interpretation. In Proc. POPL '92, pages 83-94. ACM Press, 1992.
12. P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Record of FPCA '95-Conference on Functional Programming and Computer Architecture, pages 170-181, La Jolla, California, USA, 25-28 June 1995. SIGPLAN/SIGARCH/WG2.8, ACM Press, New York, USA.
13. J. P. Gallagher, D. Boulanger, and H. Saglam. Practical model-based static analysis for definite logic programs. In Proceedings of the 1995 International Symposium on Logic Programming, pages 351-368.
14. J. P. Gallagher and L. Lafave. Regular approximation of computation paths in logic and functional languages. In Proceedings of the Dagstuhl Workshop on Partial Evaluation, pages 1-16. Springer-Verlag, February 1996.
15. F. de Boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi. Proving concurrent constraint programs correct. In Proceedings of the Twentieth ACM Symposium on Principles of Programming Languages (POPL), pages 98-108. ACM Press, 1994.
16. P. Devienne, J.-M. Talbot, and S. Tison. Solving classes of set constraints with tree automata. In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practive of Constraint Programming, pages 62-76, volume 1330 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
17. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Compositional Analysis for Concurrent Constraint Programming. In Proceedings of the Eight Annual IEEE Symposium on Logic in Computer Science, pages 210-221, 1993.
18. T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 300-309, July 1991.
19. K. L. S. Gasser, F. Nielson, and H. R. Nielson. Systematic realisation of control flow analyses for CML. In Proceedings of ICFP'97, pages 38-51. ACM Press, 1997.
20. F. Gécseg and M. Steinby. Tree Automata. Akademiai Kiado, 1984.
21. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints (extended abstract). In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 42-51, 1990.
22. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197-209, January 1990.
23. N. Heintze and J. Jaffar. Semantic types for logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 141-156. MIT Press, 1992.
24. N. Heintze and J. Jaffar. Set constraints and set-based analysis. In Proceedings of the Workshop on Principles and Practice of Constraint Programming, LNCS 874, pages 281-298. Springer-Verlag, 1994.
25. J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey. The Journal of Logic Programming, 19/20:503-582, 1994.
26. J. Jaffar and P. J. Stuckey. Semantics of infinite tree logic programming. Theoretical Computer Science, 46:141-158, 1986.
27. N. D. Jones and S. S. Muchnick. Flow analysis and optimization of lisp-like structures. In Sixth Annual ACM Symposium on Principles of Programming Languages, pages 244-256, January 1979.
28. J.W. Lloyd. Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, Berlin, Germany, second, extended edition, 1987.
29. M.J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In Proceedings of the Symposium of Logic in Computer Science, pages 348-457, IEEE Press, 1988.
30. P. Mishra. Towards a theory of types in Prolog. In IEEE International Symposium on Logic Programming, pages 289-298, 1984.
31. M. Müller. Type Analysis for a Higher-Order Concurrent Constraint Language. PhD thesis, Universität des Saarlandes, Technische Fakultät, D-66041 Saarbrücken, Germany, 1998.
32. The Oz System. Programming Systems Lab, Universit¨at des Saarlandes. Available through the WWW at http://www.ps.uni-sb.de/oz. 1997.
33. E. Palmgren. Denotational semantics of Constraint Logic Programming-a nonstandard approach. In B. Mayoh, E. Tyugu, and J. Penjam, editors, Constraint Programming, volume 131 of NATO ASI Series F: Computer and System Sciences, pages 261-288. Springer-Verlag, Berlin, Germany, 1994.
34. L. Pacholski and A. Podelski. Set Constraints: A Pearl in Research on Constraints (Tutorial Abstract). In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practive of Constraint Programming, volume 1330 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
35. J. Reynolds. Automatic Computation of Data Set De_nitions. Information Pro-cessing, 68, 1969.
36. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic Foundations of Concurrent Constraint Programming. In 18th Symposium on Principles of Programming Languages, pages 333-352. ACM Press, Jan. 1991.
37. G. Smolka. The Oz Programming Model. In Volume 1000 of Lecture Notes in Computer Science. Springer-Verlag, 1995