Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements

Information and Computation

Volumn 145, Issue 2, 1998, Pages 153-190

  Giacobazzi, Roberto ^a   Ranzato, Francesco ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Abstract domain refinement; Abstract interpretation; Logic program semantics; Uniform closure

Indexed keywords

EID: 0347565275     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2724     Document Type: Article

References (52)

1. Aczel, P. (1977), An introduction to inductive definitions, in "Handbook of Mathematical Logic," (J. Barwise, Ed.), pp. 739-782, North-Holland, Amsterdam.
2. Adaricheva, K., and Gorbunov, V. (1990), Equational closure operator and forbidden semidistributive lattices, Siberian Math. J. 30(6), 831-849.
3. Amato, G., and Levi, G. (1997), Properties of the lattice of observables in logic programming, in "Proceedings of the Italian-Portuguese-Spanish Joint Conference on Declarative Programming, (APPIA-GULP-PRODE'97)," pp. 175-187.
4. Apt, K. R. (1990), Introduction to logic programming, in "Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics" (J. van Leeuwen, Ed.), pp. 495-574, Elsevier, Amsterdam, The MIT Press, Cambridge, Mass.
5. Barbuti, R., Giacobazzi, R., and Levi, G. (1993), A general framework for semantics-based bottom-up abstract interpretation of logic programs, ACM Trans. Program. Lang. Syst. 15(1), 133-181.
6. Birkhoff, G. (1967), "Lattice Theory," AMS Colloquium Publications, Vol. XXV, 3rd ed., AMS, Providence, R.I.
7. Bol, R., and Groote, J. F. (1996), The meaning of negative premises in transition system specification, J. ACM 43(5), 863-914.
8. Bossi, A., and Cocco, N. (1993), Basic transformation operations for logic programs which preserve computed answer substitutions, J. Logic Program. 16, 47-87.
9. Bossi, A., Gabbrielli, M., Levi, G., and Martelli, M. (1994), The s-semantics approach: theory and applications, J. Logic Program. 19-20, 149-197.
10. Bossi, A., Gabbrielli, M., Levi, G., and Meo, M. (1994), A compositional semantics for logic programs, Theor. Comput. Sci. 122(1-2), 3-47.
11. Codish, M., Dams, D., and Yardeni, E. (1994), Bottom-up abstract interpretation of logic programs, Theor. Comput. Sci. 124(1), 93-126.
12. Codish, M., Mulkers, A., Bruynooghe, M., Garcia de la Banda, M., and Hermenegildo, M. (1995), Improving abstract interpretations by combining domains, ACM Trans. Program. Lang. Syst. 17(1), 28-44.
13. Comini, M., and Levi, G. (1994), An algebraic theory of observables, in "Proceedings of the 1994 International Logic Programming Symposium (ILPS'94)" (M. Bruynooghe, Ed.), pp. 172-186, MIT Press, Cambridge, MA.
14. Comini, M., Levi, G., and Meo, M. (1995), Compositionality of SLD-derivations and their abstractions, in "Proceedings of the 1995 International Symposium on Logic Programming (ILPS'95)" (J. Lloyd, Ed.), MIT Press, Cambridge, MA.
15. Cortesi, A., Filé, G., Giacobazzi, R., Palamidessi, C., and Ranzato, F. (1997), Complementation in abstract interpretation, ACM Trans. Program. Lang. Syst. 19(1), 7-47.
16. Cortesi, A., Le Charlier, B., and Van Hentenryck, P. (1994), Combinations of abstract domains for logic programming, in "Conference Record of the 21st ACM Symposium on Principles of Programming Languages (POPL '94)," pp. 227-239, ACM Press, New York.
17. Cousot, P. (1996), Abstract interpretation, ACM Comp. Surv. 28(2), 324-328.
18. Cousot, P. (1997a), Constructive design of a hierarchy of semantics of a transition system by abstract interpretation, in "Proceedings of the 13th International Symposium on Mathematical Foundations of Programming Semantics (MFPS'97)" (S. Brookes, and M. Mislove, Eds.), Electronic Notes in Theoretical Computer Science, Vol. 6, Elsevier, Amsterdam.
19. Cousot, P. (1997b), Types as abstract interpretations, in "Conference Record of the 24th ACM Symposium on Principles of Programming Languages (POPL'97)," pp. 316-331, ACM Press, New York.
20. Cousot, P., and Cousot, R. (1977), Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in "Conference Record of the 4th ACM Symposium on Principles of Programming Languages (POPL'77)," pp. 238-252, ACM Press, New York.
21. Cousot, P., and Cousot, R. (1979), Systematic design of program analysis frameworks, in "Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL'79)," pp. 269-282, ACM Press, New York.
22. Cousot, P., and Cousot, R. (1992a), Abstract interpretation and application to logic programs, J. Logic Program. 13(2-3), 103-179.
23. Cousot, P., and Cousot, R. (1992b), 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.
24. Cousot, P., and Cousot, R. (1994), Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages), in "Proceedings of the IEEE International Conference on Computer Languages (ICCL'94)," pp. 95-112, IEEE Computer Society Press, Los Alamitos, CA.
25. Cousot, P., and Cousot, R. (1995), Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form, in "Proceedings of the 7th International Conference on Computer Aided Verification (CAV'95)" (P. Wolper, Ed.), Lecture Notes in Computer Science, Vol. 939, pp. 293-308, Springer-Verlag, Berlin.
26. Deutsch, A. (1992), "Operational models of programming languages and representations of relations on regular languages with application to the static determination of dynamic aliasing properties of data," Ph.D. thesis, University of Paris VI, Paris, France.
27. Dwinger, P. (1954), On the closure operators of a complete lattice, Indagat. Math. 16, 560-563.
28. van Emden, M. H., and Kowalski, R. A. (1976), The semantics of predicate logic as a programming language, J. ACM 23(4), 733-742.
29. Fages, F., and Gori, R. (1996), A hierarchy of semantics for normal constraint logic programs, in "Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP'96)" (M. Hanus and M. Rodriguez-Artalejo, Eds.), Lecture Notes in Computer Science, Vol. 1139, pp. 77-91, Springer-Verlag, Berlin.
30. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C. (1989), Declarative modeling of the operational behavior of logic languages, Theor. Comput. Sci. 69(3), 289-318.
31. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C. (1993), A model-theoretic reconstruction of the operational semantics of logic programs, Inf. Comput. 103(1), 86-113.
32. Filé, G., Giacobazzi, R., and Ranzato, F. (1996), A unifying view of abstract domain design, ACM Comput. Surv. 28(2), 333-336.
33. Filé, G., and Ranzato, F. (1998), The powerset operator on abstract interpretations, Theor. Comput. Sci, to appear.
34. Giacobazzi, R. (1996), "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 (STACS'96)" (C. Puech, Ed.), Lecture Notes in Computer Science, Vol. 1046, pp. 503-514, Springer-Verlag, Berlin.
35. Giacobazzi, R., Palamidessi, C., and Ranzato, F. (1996), Weak relative pseudo-complements of closure operators, Algebra Universalis 36(3), 405-412.
36. Giacobazzi, R., and Ranzato, F. (1995), Functional dependencies and Moore-set completions of abstract interpretations and semantics, in "Proceedings of the 1995 International Symposium on Logic Programming (ILPS'95)" (J. Lloyd, Ed.), pp. 321-335, MIT Press, Cambridge, MA.
37. Giacobazzi, R., and Ranzato, F. (1996), Complementing logic program semantics, in "Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP'96)" (M. Hanus and M. Rodríguez-Artalejo, Eds.), Lecture Notes in Computer Science, Vol. 1139, pp. 238-253, Springer-Verlag, Berlin.
38. Giacobazzi, R., and Ranzato, F. (1997), Refining and compressing abstract domains, in ́Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97)́ (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds.), Lecture Notes in Computer Science, Vol. 1256, pp. 771-781, Springer-Verlag, Berlin.
39. Giacobazzi, R., and Ranzato, F. (1998), Optimal domains for disjunctive abstract interpretation, Sci. Comput. Program 32(1-3), 177-210.
40. Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M., and Scott, D. S. (1980), ́A Compendium of Continuous Lattices,́ Springer-Verlag, Berlin.
41. Granger, P. (1988), Combinations of semantic analyses, in ́Proceedings of the 2nd French-Soviet Workshop on Methods of Compilation and Program Construction, Informatika '88́ (P. Deransart, Ed.), pp. 71-88, INRIA, Rocquencourt, France.
42. Hoare, C. A. R., Hayes, I. J., Jifeng, H., Morgan, C. C., Roscoe, A. W., Sanders, J. W., Sorensen, I. H., Spivey, J. M., and Sufrin, B. A. (1987), Laws of programming, Comm. ACM 30(8), 672-686.
43. Jensen, T. (1997), Disjunctive program analysis for algebraic data types, ACM Trans. Program. Lang. Syst. 19(5), 751-803.
44. Lassez, J., and Maher, M. (1984), Closures and fairness in the semantics of programming logic, Theor. Comput. Sci. 29, 167-184.
45. Morgado, J. (1960), Some results on the closure operators of partially ordered sets, Portugal. Math. 19(2), 101-139.
46. Morgado, J. (1962), On complete congruences of complete lattices, Portugal. Math. 21(1), 11-25.
47. Muthukumar, K., and Hermenegildo, M. (1991), Combined determination of sharing and freeness of program variables through abstract interpretation, in "Proceedings of the 8th International Conference on Logic Programming (ICLP'91)" (K. Furukawa, Ed.), pp. 49-63, MIT Press, Cambridge, MA.
48. Nielson, F. (1984), Abstract Interpretation using Domain Theory, Ph.D. thesis CST-31/84, University of Edinburgh, Edinburgh, Scotland.
49. Plotkin, G. (1981), A structural approach to operational semantics, Tech. Rep. DAIMI FN-19, Computer Science Dept., Aarhus University, Aarhus, Denmark.
50. Sundararajan, R., and Conery, J. (1992), An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs, in "Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'92)" (R. Shyamasundar, Ed.), Lecture Notes in Computer Science, Vol. 652, pp. 203-216, Springer-Verlag, Berlin.
51. Ward, M. (1942), The closure operators of a lattice, Ann. Math. 43(2), 191-196.
52. Yi, K., and Harrison, W. L. (1993), Automatic generation and management of interprocedural program analyses, in "Conference Record of the 20th ACM Symposium on Principles of Programming Languages (POPL'93)," pp. 246-259, ACM Press, New York.