Abstract
We study the relations among various abstract domains for groundness analyses of logic programming. We re-construct Pos as a logical domain and prove that it is the optimal abstract domain for groundness analysis which can be constructed starting from the property of groundness by applying only logic operations.
Preview
Unable to display preview. Download preview PDF.
References
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.
T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Boolean functions for dependency analysis: algebraic properties and efficient representation. In B. Le Charlier, editor, Proc. of the 1st Int'l Static Analysts Symposium (SAS '94), volume 864 of LNCS, pages 266–280. Springer-Verlag, 1994.
G. Birkhoff. Lattice theory. In AMS Colloquium Publication, third ed. AMS Press, 1967.
A. Cortesi, G. Filè, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proc. Sixth IEEE Symp. on Logic In Computer Science, pages 322–327. IEEE Computer Society Press, 1991.
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.
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.
S.K. Debray. Static inference of modes and data dependencies in logic programs. ACM TOPLAS, 11:418–450,1989.
G. Filé and F. Ranzato. Improving abstract interpretations by systematic lifting to the powerset. In M. Bruynooghe, editor, Proc. of the 1994 Int'l Logic Programming Symposium (ILPS '94), pages 655–669. The MIT Press, 1994.
G. Filé and F. Ranzato. The Powerset Operator on Abstract Interpretations. To appear in Theoretical Computer Science, 1997.
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.
R. 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.
G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, and D.S. Scott. ACompendium of Continuous Lattices. Springer-Verlag, 1980.
N. D. Jones and H. Sondergaard. A Semantics-based biramework for the Abstract Interpretation of Prolog. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 123–142. Ellis Horwood Ltd, 1987.
N.D. Jones, K. Marriot, and H. Søndergaard. Denotational abstract interpretation of logic programs. ACM TOPLAS, 16:607–648, 1994.
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.
K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1-4):181–196, 1993.
J. Morgado. Some results on the closure operators of partially ordered sets. Portugaliæ Mathematica, 19(2):101–139, 1960. *** DIRECT SUPPORT *** A0008C44 00003
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scozzari, F. (1997). Logical optimality of groundness analysis. In: Van Hentenryck, P. (eds) Static Analysis. SAS 1997. Lecture Notes in Computer Science, vol 1302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032735
Download citation
DOI: https://doi.org/10.1007/BFb0032735
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63468-3
Online ISBN: 978-3-540-69576-9
eBook Packages: Springer Book Archive