Abstract
In this paper we propose an abstract version of the denotational semantics defined in [8]. This leads to a precise goal-independent abstract interpretation of Prolog programs. We deal with the control rules of Prolog and the cut operator. Moreover, we get a simple denotation for negation as finite failure. The abstract analysis is proposed both for computed answers analysis and for call patterns analysis. In both cases the abstract semantics is finitely computable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Barbuti, M. Codish, R. Giacobazzi, and G. Levi. Modelling Prolog Control. Journal of Logic and Computation, 3:579–603, 1993.
R. Barbuti, M. Codish, R. Giacobazzi, and M. Maher. Oracle Semantics for PRO-LOG. Information and Computation, 1995.
P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238–252, 1977.
P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3):103–179, 1992.
B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
B. Le Charlier, Rossi S., and P. Van Hentenryck. An Abstract Interpretation Framework which Accurately Handles PROLOG Search Rule and the Cut. In M. Bruynooghe, editor, Proceedings of the 1994 Int’l Symposium on Logic Programming, pages 157–171. The MIT Press, 1994.
G. Levi and D. Micciancio. Analysis of pure PROLOG programs. In M.I. Sessa, editor, Proceedings GULP-PRODE’ 95, 1995 Joint Conference on Declarative Programming, 1995.
F. Spoto and G. Levi. A denotational semantics for PROLOG. In M. Falaschi, M. Navarro, and Policriti A., editors, Proceedings of the Joint Conference on Declarative Programming, APPIA-GULP-PRODE’ 97, pages 201–212, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spoto, F., Levi, G. (1998). Abstract Interpretation of Prolog Programs. In: Haeberer, A.M. (eds) Algebraic Methodology and Software Technology. AMAST 1999. Lecture Notes in Computer Science, vol 1548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49253-4_32
Download citation
DOI: https://doi.org/10.1007/3-540-49253-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65462-9
Online ISBN: 978-3-540-49253-5
eBook Packages: Springer Book Archive