Abductive analysis of modular logic programs

Journal of Logic and Computation

Volumn 8, Issue 4, 1998, Pages 457-483

  Giacobazzi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Abduction; Abstract interpretation; Logic programming; Modular logic programs; Program specification; Static analysis

Indexed keywords

DATA FLOW ANALYSIS; OPTIMIZATION;

ABSTRACT INTERPRETATION; MODULAR LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 0032141612     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/8.4.457     Document Type: Article

References (30)

1. T. Armstrong, K. Marriott, P. Schachte and H. Søndergaard. Boolean functions for dependency analysis: algebraic properties and efficient representation. In Proceedings of of SAS '94, pp. 266-280, Vol. 864 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1994.
2. K. R. Apt. Introduction to logic programming. In Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, J. van Leeuwen, ed. pp. 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990.
3. R. Barbuti, R. Giacobazzi and G. Levi. A general framework for semantics-based bottom-up abstract interpretation of logic programs. ACM Transactions on Programming Languages and Systems, 15, 133-181, 1993.
4. G. Birkhoff. Lattice Theory, 3rd edn. AMS Colloqium Publications, Vol. XXV, 1967.
5. A. Bossi, M. Gabbrielli, G. Levi and M. C. Meo. A compositional semantics for logic programs. Theoretical Computer Science, 122, 3-47, 1994.
6. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10, 91-124, 1991.
7. M. Codish, D. Dams and E. Yardeni. Bottom-up abstract interpretation of logic programs. Theoretical Computer Science, 124, 93-126, 1994.
8. M. Codish, S. K. Debray and R. Giacobazzi. Compositional analysis of modular logic programs. In Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, (POPL '93), pp. 451-464. ACM Press, New York, 1993.
9. M. Codish, M. Falaschi and K. Marriott. Suspension analysis for concurrent logic programs. In Proceedings of the Eighth International Conference on Logic Programming, K. Furukawa, ed. pp. 331-345. The MIT Press, Cambridge, MA, 1991.
10. A. Cortesi, G. Filè and W. Winsborough. Prop revisited: propositional formula as abstract domain for groundness analysis. In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science, pp. 322-327. IEEE Computer Society Press, Los Alamitos, CA, 1991.
11. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the Fourth Annual ACM Annual ACM Symposium on Principles of Programming Languages, (POPL '77), pp. 238-252, New York, 1977.
12. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages, (POPL '79), pp. 269-282, New York, 1979.
13. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Conference Record of the 19th ACM Symposium on Principles of Programming Languages (POPL '92), pp. 83-94. ACM Press, New York, 1992.
14. S. K. Debray. Efficient dataflow analysis of logic programs. Journal of the ACM, 39, 949-984, 1992.
15. F. Denis and J.-P. Delahaye. Unfolding, procedural and fixpoint semantics of logic programs. In STACS 91, C. Choffrut and M. Jantzen, eds. Vol. 480 of Lecture Notes in Computer Science, pages 511-522. Springer-Verlag, Berlin, 1991.
16. M. Falaschi, G. Levi, M. Martelli and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science, 69, 289-318, 1989.
17. M. Gabbrielli, R. Giacobazzi and D. Montesi. Modular logic programs over finite domains. In Proceedings of the Eighth Italian Conference on Logic Programming, D. Saccà, ed. pp. 663-678, 1993. Also available as Technical Report LIX - Ecole Polytechnique LIX/RR/94/04, URL http://www.di.unipi.it/~giaco/papers.html.
18. R. Giacobazzi. Semantic Aspects of Logic Program Analysis. PhD thesis, Dipartimento di Informatica, Università di Pisa, 1993. TD-18/93. URL http://www.di.unipi.it/~giaco/papers.html.
19. R. Giacobazzi. Abductive analysis of modular logic programs. In Proceedings of the Eleventh International Logic Programming Symposium, (ILPS '94), M. Bruynooghe, ed. pp. 377-391. The MIT Press, Cambridge, MA, 1994.
20. R. Giacobazzi. Optimal' collecting semantics for analysis in a hierarchy of logic program semantics. In Proceedings of the 13th International Symposium on Theoretical Aspects of Computer Science (STAGS '96), C. Puech, ed. pp. 503-514. Vol. 1046 of Lecture Notes in Computer Science, Springer-Verlag, 1996.
21. R. Giacobazzi, S. Debray and G. Levi. Generalized semantics and abstract interpretation for constraint logic programs. Journal of Logic Programming, 25, 191-248, 1995.
22. R. Giacobazzi and F. Ranzato. Functional dependencies and Moore-set completions of abstract interpretations and semantics. In Proceedings of the 1995 International Logic Programming Symposium (ILPS '95), J. Lloyd, ed. pp. 321-335. The MIT Press, Cambridge, MA, 1995.
23. C. A. R. Hoare, I. J. Hayes, H. Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders, I. H. Sorensen, J. M. Spivey and B. A. Sufrin. Laws of programming. Communications of the ACM, 30, 672-686, 1987.
24. M. Hermenegildo, R. Warren and S. K. Debray. Global flow analysis as a practical compilation tool. Journal of Logic Programming, 13, 349-366, 1992.
25. D. Jacobs and A. Langen. Static Analysis of logic programs for independent AND parallelism. Journal of Logic Programming, 13, 291-314, 1992.
26. J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, (POPL '87), pp. 111-119. ACM, New York, 1987.
27. A. C. Kakas, R. A. Kowalski and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2, 719-770, 1993.
28. G. Levi. Models, unfolding rules and fixpoint semantics. In Proceedings of the Fifth International Conference on Logic Programming, R. A. Kowalski and K. A. Bowen, eds. pp. 1649-1665. The MIT Press, Cambridge, MA, 1988.
29. K. Marriott and H. Søndergaard. Bottom-up dataflow analysis of normal logic programs. Journal of Logic Programming, 13, 181-204, 1992.
30. D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36, 27-47, 1988.