Skip to main content
SpringerLink
Log in

Reexecution-Based Analysis of Logic Programs with Delay Declarations

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 2001)

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

  • 363 Accesses

Abstract

A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on reexecution. The concrete and abstract semantics express both deadlock information and qualified answers.

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. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.

    Google Scholar 

  2. K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. Lecture Notes in Computer Science, 936:66–80, 1995.

    Google Scholar 

  3. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10(2):91–124, February 1991.

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Bruynooghe, G. Janssens, A. Callebaut, and B. Demoen. Abstract interpretation: Towards the global optimization of Prolog programs. In Proceedings of the 1987 Symposium on Logic Programming, pages 192–204, San Francisco, California, August 1987. Computer Society Press of the IEEE.

    Google Scholar 

  5. A. Cortesi, G. Filé, and W. Winsborough. Optimalgroundness analysis using propositionall ogic. Journal of Logic Programming, 27(2):137–167, May 1996.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combination of abstract domains for logic programming. In Proceedings of the 21th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’94), Portland, Oregon, January 1994.

    Google Scholar 

  7. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combination of abstract domains for logic programming: open product and generic pattern construction. Science of Computer Programming, 28(1–3):27–71, 2000.

    Article  Google Scholar 

  8. A. Cortesi, S. Rossi, and B. Le Charlier. Operational semantics for reexecutionbased analysis of logic programs with delay declarations. Electronic Notes in Theoretical Computer Science, 48(1), 2001. http://www.elsevier.nl/locate/entcs.

  9. 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 Fourth ACM Symposium on Programming Languages (POPL’77), pages 238–252, Los Angeles, California, January 1977.

    Google Scholar 

  10. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of Sixth ACM Symposium on Programming Languages (POPL’79), pages 269–282, Los Angeles, California, January 1979.

    Google Scholar 

  11. M. Garcia de la Banda, K. Marriott, and P. Stuckey. Efficient analysis of logic programs with dynamic scheduling. In J. Lloyd, editor, Proc. Twelfth International Logic Programming Symposium, pages 417–431. MIT Press, 1995.

    Google Scholar 

  12. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Constraint logic programming with dynamic scheduling: A semantics based on closure operators. Information and Computation, 137(1):41–67, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  13. Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User’s Manual, 1998. http://www.sics.se/isl/sicstus/sicstus toc.html.

  14. B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(1):35–101, January 1994.

    Article  Google Scholar 

  15. B. Le Charlier and P. Van Hentenryck. Reexecution in abstract interpretation of Prolog. Acta Informatica, 32:209–253, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  16. J.W. Lloyd. Foundations of Logic Programming. Springer Series: Symbolic Computation-Artificial Intelligence. Springer-Verlag, second, extended edition, 1987.

    Google Scholar 

  17. E. Marchiori and F. Teusink. Proving termination of logic programs with delay declarations. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 447–464, Cambridge, December 4–7 1995. MIT Press.

    Google Scholar 

  18. K. Marriott, M. Garcia de la Banda, and M. Hermenegildo. Analyzing logic programs with dynamic scheduling. In Proc. 21st Annual ACM Symp. on Principles of Programming Languages, pages 240–253. ACM Press, 1994.

    Google Scholar 

  19. L. Naish. Negation and control in Prolog. Number 238 in Lecture Notes in Computer Science. Springer-Verlag, New York, 1986.

    MATH  Google Scholar 

  20. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Evaluation of the domain Prop. Journal of Logic Programming, 23(3):237–278, June 1995.

    Article  MATH  Google Scholar 

  21. K. Yelick and J. Zachary. Moded type systems for logic programming. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages (POPL’89), pages 116–124, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari di Venezia, via Torino 155, 30172, Venezia, Italy

    Agostino Cortesi & Sabina Rossi

  2. Departement d’ingegnierie Informatique, Universite Catholique de Louvain, 2, Place Sainte-Barbe, B-1348, Louvain-la-Neuve (Belgique)

    Baudouin Le Charlier

Authors
  1. Agostino Cortesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Baudouin Le Charlier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sabina Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Informatics and Mathematical Modelling, Technical University of Denmark, Bldg.322, 106-108, Richard Petersens Plads, 2800, Lyngby, Denmark

    Dines Bjørner

  2. Computer Science Department, Technical University of Munich, Arcisstr.21, 80290, Munich, Germany

    Manfred Broy

  3. A.P.Ershov Institute of Informatics Systems, Acad.Lavrentjev ave.,6, 630090, Novosibirsk, Russia

    Alexandre V. Zamulin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cortesi, A., Charlier, B.L., Rossi, S. (2001). Reexecution-Based Analysis of Logic Programs with Delay Declarations. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-45575-2_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43075-9

  • Online ISBN: 978-3-540-45575-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation