Skip to main content
SpringerLink
Log in

Abstract Interpretation of Prolog Programs

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1548))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Barbuti, M. Codish, R. Giacobazzi, and G. Levi. Modelling Prolog Control. Journal of Logic and Computation, 3:579–603, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Barbuti, M. Codish, R. Giacobazzi, and M. Maher. Oracle Semantics for PRO-LOG. Information and Computation, 1995.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3):103–179, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56100, Pisa, Italy

    Fausto Spoto & Giorgio Levi

Authors
  1. Fausto Spoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Levi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática, Pontifícia Laboratório de Métodos Formais, Universidade Católica do Rio de Janeiro, Rua Marquês De São Vicente, 225, 22453-900, Rio de Janeiro, RJ, Brazil

    Armando M. Haeberer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation