A logical model for relational abstract domains

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 5, 1998, Pages 1067-1109

  Giacobazzi, Roberto ^a   Scozzari, Francesca ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

D.3.4 Programming Languages : Processors optimization; F.3.2 Logics and Meanings of Programs : Semantics of Programming Languages program analysis; F.4.1 Mathematic Logic and Formal Languages : Mathematical Logic; Languages; Theory

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; LOGIC PROGRAMMING; MATHEMATICAL MODELS;

HEYTING COMPLETION;

PROGRAMMING THEORY;

EID: 0032153905     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/293677.293680     Document Type: Article

References (59)

1. AIKEN, A. AND LAKSHMAN, T. 1994. Directional type checking of logic programs. In Proceedings of the 1st International Static Analysis Symposium (SAS '94), B. L. Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 43-60.
2. APT, K. 1990. Introduction to logic programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B, Formal Models and Semantics. Elsevier, Amsterdam, 495-574.
3. ARMSTRONG, T., MARRIOTT, K., SCHACHTE, P., AND SØNDERGAARD, H. 1994. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In Proceedings of the 1st International Static Analysis Symposium (SAS '94), B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 266-280.
4. 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.
5. BENTON, P. 1992a. Strictness analysis of lazy functional programs. Ph.D. thesis, University of Cambridge, Cambridge, U.K.
6. BENTON, P. 1992b. Strictness logic and polymorphic invariance. In Proceedings of the 2nd International Symposium on Logical Foundation of Computer Science, A. Nerode and M. Taitslin, Eds. Lecture Notes in Computer Science, vol. 620. Springer-Verlag, Berlin, 33-44.
7. BIRKHOFF, G. 1967. Lattice Theory. AMS Colloquium Publication, 3rd edition. AMS, Providence, R.I.
8. BRONSARD, F., LAKSHMAN, T., AND REDDY, U. 1992. A framework of directionality for proving termination of logic programs. In Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming. MIT Press, Cambridge, Mass., 321-335.
9. BRUYNOOGHE, M. 1991. A practical framework for the abstract interpretation of logic programs. J. Logic Programm. 10, 91-124.
10. CLICK, C. AND COOPER, K. D. 1995. Combining analyses, combining optimizations. ACM Trans. Program. Lang. Syst. 17, 2, 181-196.
11. CODISH, M. AND DEMOEN, B. 1994. Deriving type dependencies for logic programs using multiple incarnations of prop. In Proceedings of the 1st International Static Analysis Symposium (SAS '94), B. L. Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 281-297.
12. CODISH, M., DAMS, D., AND YARDENI, E. 1994. Bottom-up abstract interpretation of logic programs. Theor. Comput. Sci. 124, 1, 93-126.
13. CODISH, M., MULKERS, A., BRUYNOOGHE, M., GARCÍA DE LA BANDA, M., AND HERMENEGILDO, M. 1995. Improving abstract interpretations by combining domains. ACM Trans. Program. Lang. Syst. 17, 1, 28-44.
14. 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.
15. CORTESI, A., FILÉ, G., AND WINSBOROUGH, W. 1996. Optimal groundness analysis using prepositional logic. J. Logic Program. 27, 2, 137-167.
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). ACM Press, New York, 227-239.
17. COUSOT, P. 1978. Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique des programmes. Ph.D. thesis, Université Scientifique et Médicale de Grenoble, Grenoble, France.
18. COUSOT, P. 1996. Abstract interpretation. ACM Comput. Surv. 28, 2, 324-328.
19. 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). ACM Press, New York, 238-252.
20. 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). ACM Press, New York, 269-282.
21. COUSOT, P. AND COUSOT, R. 1992. Abstract interpretation and application to logic programs. J. Logic Program. 13, 2-3, 103-179.
22. 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). IEEE Computer Society Press, Los Alamitos, Calif., 95-112.
23. DAMS, D., GERTH, R., AND GRUMBERG, O. 1997. Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst. 19, 2, 253-291.
24. DART, P. 1991. On derived dependencies and connected databases. J. Logic Program. 11, 2, 163-188.
25. DAVEY, B. A. AND PRIESTLEY, H. A. 1990. Introduction to Lattices and Order. Cambridge University Press, Cambridge, U.K.
26. FILÉ, G., GIACOBAZZI, R., AND RANZATO, F. 1996. A unifying view of abstract domain design. ACM Comput. Surv. 28, 2, 333-336.
27. FILÉ, G. AND RANZATO, F. 1994. Improving abstract interpretations by systematic lifting to the powerset. In Proceedings of the 1994 International Logic Programming Symposium (ILPS '94), M. Bruynooghe, Ed. The MIT Press, Cambridge, Mass., 655-669.
28. FILÉ, G. AND RANZATO, F. 1998. The powerset operator on abstract interpretations. To appear in Theor. Comput. Sci., Preliminary version in Filé and Ranzato [1994].
29. FREESE, R., JEZEK, J., AND NATION, J. 1995. Free lattices. Mathematical surveys and monographs, vol. 42. AMS, Providence, R.I.
30. 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. The MIT Press, Cambridge, Mass., 321-335.
31. GIACOBAZZI, R. AND RANZATO, F. 1996. Compositional optimization of disjunctive abstract interpretations. In Proc. of the 1996 European Symposium on Programming, H. Nielson, Ed. Lecture Notes in Computer Science, vol. 1058. Springer-Verlag, Berlin, 141-155.
32. GIACOBAZZI, R. AND RANZATO, F. 1997a. Completeness in abstract interpretation: A domain perspective. In Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology (AMAST '97), M. Johnson, Ed. Lecture Notes in Computer Science, vol. 1349. Springer-Verlag, Berlin, 231-245.
33. GIACOBAZZI, R. AND RANZATO, F. 1997b. 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. Springer-Verlag, Berlin, 771-781.
34. GIACOBAZZI, R. AND RANZATO, F. 1998. The reduced relative power operation of abstract domains. To appear in Theor. Comput. Sci., Preliminary version in Giacobazzi and Ranzato [1995].
35. GIACOBAZZI, R., RANZATO, F., AND SCOZZARI, F. 1998b. Building complete abstract interpretations in a linear logic-based setting. In Proceedings of Fifth International Static Analysis Symposium (SAS'98), G. Levi, Ed. Lecture Notes in Computer Science. Springer-Verlag, Berlin. To appear.
36. GIACOBAZZI, R., RANZATO, F., AND SCOZZARI, F. 1998a. Complete abstract interpretations made constructive. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS '98), J. Gruska and J. Zlatuska, Eds. Lecture Notes in Computer Science, vol. 1450. Springer-Verlag, Berlin, 366-377.
37. GIRARD, J.-Y., LAFONT, Y., AND TAYLOR, P. 1989. Proofs and Types. Cambridge University Press, Cambridge, U.K.
38. HALMOS, P. 1962. Algebraic Logic. Chelsea Publ. Co., New York.
39. HANKIN, C. AND METAYER, D. L. 1994. Deriving algorithms from type inference systems: Applications to strictness analysis. In Conference Record of the 21st ACM Symposium on Principles of Programming Languages (POPL '94). ACM Press, New York, 202-212.
40. JACOBS, D. AND LANGEN, A. 1992. Static analysis of logic programs for independent AND-parallelism. J. Logic Program. 13, 2-3, 154-165.
41. JAFFAR, J. AND LASSEZ, J.-L. 1987. Constraint Logic Programming. In Conference Record of the ACM Symposium on Principles of Programming Languages (POPL '57). ACM Press, New York, 111-119.
42. JENSEN, T. 1995. Conjunctive type systems and abstract interpretation of higher-order functional languages. J. Logic Comput. 5, 4, 397-421.
43. JENSEN, T. P. 1992. Disjunctive strictness analysis. In Proceedings of the 7th IEEE Symposium on Logic in Computer Science (LICS '92). IEEE Computer Society Press, Los Alamitos, Calif., 174-185.
44. JONES, N. D. AND MUCHNICK, S. S. 1981. Complexity of flow analysis, inductive assertion synthesis and a language due to dijkstra. In Program Flow Analysis: Theory and Applications, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Upper Saddle River, N.J., 380-393.
45. JONES, N. D. AND SØNDERGAARD, H. 1987. A semantics-based framework for the abstract interpretation of Prolog. In Abstract Interpretation of Declarative Languages, S. Abramsky and C. Hankin, Eds. Ellis Horwood Ltd, Chichester, UK, 123-142.
46. LANGEN, A. 1990. Static analysis for independent And-parallelism in logic programs. Ph.D. thesis, Univ. of Southern California, Los Angeles, Calif.
47. MARRIOTT, K. AND SØNDERGAARD, H. 1993. Precise and efficient groundness analysis for logic programs. ACM Lett. Program. Lang. Syst. 2, 1-4, 181-196.
48. MORGADO, J. 1960. Some results on the closure operators of partially ordered sets. Portugalœ-Mathematica 19, 2, 101-139.
49. 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. The MIT Press, Cambridge, Mass., 49-63.
50. MYCROFT, A. 1993. Completeness and predicate-based abstract interpretation. In Proceedings of the ACM Symposium on Partial Evaluation and Program Manipulation (PEPM '93). ACM Press, New York, 179-185.
51. MYCROFT, A. AND NIELSON, F. 1983. Strong abstract interpretation using power domains. In Proceedings of the 10th International Colloquium on Automata, Languages and Programming (ICALP '83), J. Díaz, Ed. Lecture Notes in Computer Science, vol. 154. Springer-Verlag, Berlin, 536-547.
52. NIELSON, F. 1985. Tensor products generalize the relational data flow analysis method. In Proceedings of the 4th Hungarian Computer Science Conference, M. Arató, I. Kátai, and L. Varga, Eds. 211-225.
53. SARASWAT, V., RINARD, V. A., AND PANANGADEN, P. 1991. Semantic foundations of concurrent constraint programming. In Conference Record of the 18th ACM Symposium on Principles of Programming Languages (POPL '91). ACM Press, New York, 333-353.
54. SCOZZARI, F. 1997. Logical optimality of groundness analysis. In Proceedings of the 4th International Static Analysis Symposium (SAS '97), P. Van Hentenryck, Ed. Lecture Notes in Computer Science, vol. 1302. Springer-Verlag, Berlin, 83-97.
55. 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. Springer-Verlag, Berlin, 203-216.
56. VAN DALEN, D. 1994. Logic and Structure. 3rd ed. Springer-Verlag, Berlin.
57. VICKERS, S. 1989. Topology via Logic. Cambridge University Press, Cambridge, U.K.
58. WARD, M. 1942. The closure operators of a lattice. Ann. Math. 43, 2, 191-196.
59. 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). ACM Press, New York, 246-259.