Logical optimality of groundness analysis

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

Volumn 1302, Issue , 1997, Pages 83-97

  Scozzari, Francesca ^a,b  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract interpretation; Groundness; Intuitionistic logic; Logic programming; Static analysis

Indexed keywords

LOGIC PROGRAMMING; STATIC ANALYSIS;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; GROUNDNESS; INTUITIONISTIC LOGIC; LOGIC OPERATIONS; OPTIMALITY;

COMPUTER CIRCUITS;

EID: 84922272969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032735     Document Type: Article

References (17)

1. K.R. Apt. Introduction to logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
2. T. Armstrong, K. Marriott, P. Schachte, and H. Sandergaard. Boolean functions for dependency analysis: algebraic properties and efficient representation. In B. Le Charlier, editor, Proc. of the 1st Int'l Static Analysis Symposium (SAS '94), volume 864 of LNCS, pages 266-280. Springer-Verlag, 1994.
3. G. Birkhoff. Lattice theory. In AMS Colloquium Publication, third eel. AMS Press, 1967.
4. A. Cortesi, G. Filè, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proe. Sixth IEEE Syrup. on Logic In Computer Science, pages 322-327. IEEE Computer Society Press, 1991.
5. P. Cousot and R. Cousot. 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), pages 238-252. ACM Press, 1977.
6. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL '79), pages 269-282. ACM Press, 1979.
7. S.K. Debray. Static inference of modes and data dependencies in logic programs. ACM TOPLAS, 11:418-450, 1989.
8. G. Fil~ and F. Ranzato. Improving abstract interpretations by systematic lifting to the powerset. In M. Bruynooghe, editor, Proc. of the I 994 Int'l Logic Programming Symposium (ILPS '94), pages 655-669. The MIT Press, 1994.
9. G. Fil~ and F. Ranzato. The Powerset Operator on Abstract Interpretations. To appear in Theoretical Computer Science, 1997.
10. R. Giacobazzi and F. Ranzato. Compositional optimization of disjunctive abstract interpretations. In H.R. Nielson, editor, Proc. of the 1996 European Symposium on Programming, volume 1058 of LNCS, pages 141-155. Springer-Verlag, Berlin, 1996.
11. tL Giacobazzi and F. Scozzari. Intuitionistic implication in abstract interpretation. In Proceedings of Ninth International Symposium on Programming Languages, Implementations, Logics and Programs PLILP'97, Lecture Notes in Computer Science. Springer-Verlag, 1997. To appear.
12. G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, and D.S. Scott. A Compendium of Continuous Lattices. Springer-Verlag, 1980.
13. N. D. Jones and H. Sondergaard. A Semantics-based Framework for the Abstract Interpretation of Prolog. In S. Abramsky and C. Hank[u, editors, Abstract Interpretation of Declarative Languages, pages 123-142. Ellis Horwood Ltd, 1987.
14. N.D. Jones, K. Marriot, and H. Scndergaard. Denotational abstract interpretation of logic programs. ACM TOPLAS, 16:607-648, 1994.
15. K. Marriott and H. Søndergaard. Abstract interpretation of logic programs: the denotational approach. In A. Bossi, editor, Proc. GULP '90, pages 399-425. Padova, 1990.
16. K. Marriott and H. Scndergaard. Precise and efficient groundness analysis for logic programs, ACM Letters on Pragrarnming Languages and Systems, 2(1-4):181-196, 1993.
17. J. Morgado. Some results on the closure operators of partially ordered sets. Portugaliæ Mathematica, 19(2):101-139, 1960.