Skip to main content
Springer Nature Link
Log in

Analysis of Logic Programs with Delay

  • Conference paper
  • First Online:
Logic Program Synthesis and Transformation (LOPSTR 1997)

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

  • 148 Accesses

Abstract

The paper focuses on practical analyses for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness. A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. An implementation has been built which shows that the analysis can be both accurate and efficient.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. F. Benoy, M. Codish, A. Heaton, and A. King. Widening Pos for Efficient and Scalable Groundness Analysis of Logic Programs. Submitted for Publication.

    Google Scholar 

  2. M. Carlsson. Personal communication on the freeze/2 and block declaration awakening order in SICStus Prolog 3. April 1996.

    Google Scholar 

  3. M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop. In SAS’94, pages 281–297. Springer-Verlag, 1994.

    Google Scholar 

  4. M. Codish and B. Demoen. Analysing Logic Programs using “prop”-ositional Logic Programs and a Magic Wand. Journal of Logic Programming, 25(3):249–274, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Codish, M. Falaschi, and K. Marriott. Suspension analyses for concurrent logic programs. ACM Transactions on Programming Languages and Systems, 16(3):649–686, 1994.

    Article  Google Scholar 

  6. P. Codognet and G. Filé. Computations, Abstractions and Constraints. Technical report, Dipartimento di Matematica Pura e Applicata, Università di Padova, 1991.

    Google Scholar 

  7. A. Cortesi, G. Filé, and W. Winsborough. Optimal Groundness Analysis using Propositional Logic. Journal of Logic Programming, 27(1, 2 and 3):137–169, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. Debray, D. Gudeman, and P. Bigot. Detection and Optimization of Suspension-free Logic Programs. In ILPS’94, pages 487–504. MIT Press, 1994.

    Google Scholar 

  9. S.K. Debray. QD-Janus: A Sequential Implementation of Janus in Prolog. Software-Practice and Experience, 23(12):1337–1360, 1993.

    Article  Google Scholar 

  10. J. Gallagher, D. Boulanger, and H. Saglam. Practical Model-Based Static Analysis for Definite Logic Programs. Technical Report CSTR-95-011, University of Bristol, 1995.

    Google Scholar 

  11. J. Gallagher and A. de Waal. Fast and precise regular approximations of logic programs. In ICLP’94, pages 599–613. MIT Press, 1994.

    Google Scholar 

  12. M. García de la Banda, K. Marriott, H. Søndergaard, and P. Stuckey. Improved Analysis of Logic Programs using a Differential Approach. Technical Report 95/20, Computer Science Department, Melbourne University, May 1995.

    Google Scholar 

  13. M. García de la Banda, K. Marriott, and P. Stuckey. Effcient Analysis of Logic Programs with Dynamic Scheduling. In ILPS’95, pages 4170–431. MIT Press, 1995.

    Google Scholar 

  14. R. Giacobazzi, S. K. Debray, and G. Levi. A generalised semantics for constraint logic programs. In FGCS’92, pages 581–591. ACM Press, 1992.

    Google Scholar 

  15. M. Hermenegildo, R. Warren, and S. K. Debray. Global flow analysis as a practical compilation tool. J. Logic Programming, 13(1, 2, 3 and 4):349–366, 1992.

    Article  Google Scholar 

  16. K. Marriott, M. García de la Banda, and M. Hermenegildo. Analyzing Logic Programs with Dynamic Scheduling. In POPL’94, pages 240–253. ACM Press, 1994.

    Google Scholar 

  17. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis. ACM Lett. Program. Lang. Syst., 13(2–3):181–196, 1993.

    Article  Google Scholar 

  18. G. Puebla, M. García de la Banda, K. Marriott, and P. Stuckey. Optimization of Logic Programs with Dynamic Scheduling. In ICLP’97. MIT Press, 1997.

    Google Scholar 

  19. A. Verden. Personal communication on freeze/2 and the const_delay module of IF/Prolog V5.0. April 1996.

    Google Scholar 

  20. E. Zaffanella, R. Giacobazzi, and G. Levi. Abstracting Synchronisation in Concurrent Constraint Programming. In PLILP’94, pages 57–72. Springer-Verlag, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Studies, University of Leeds, LS2 9JT, UK

    Andrew Heaton & Pat Hill

  2. Computing Laboratory, University of Kent at Canterbury, CT2 7NF, UK

    Andy King

Authors
  1. Andrew Heaton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pat Hill
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andy King
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Zurich, CH-8057, Zurich, Switzerland

    Norbert E. Fuchs

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heaton, A., Hill, P., King, A. (1998). Analysis of Logic Programs with Delay. In: Fuchs, N.E. (eds) Logic Program Synthesis and Transformation. LOPSTR 1997. Lecture Notes in Computer Science, vol 1463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49674-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-49674-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65074-4

  • Online ISBN: 978-3-540-49674-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics