Skip to main content
SpringerLink
Log in

Non-termination Analysis of Logic Programs Using Types

  • Conference paper
Logic-Based Program Synthesis and Transformation (LOPSTR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6564))

Abstract

In recent years techniques and systems have been developed to prove non-termination of logic programs for certain classes of queries. In previous work, we developed such a system based on mode-information and a form of loop checking performed at compile time.

In the current paper we improve this technique by integrating type information in the analysis and by applying non-failure analysis and program specialization. It turns out that there are several classes of programs for which existing non-termination analyzers fail and for which our extended technique succeeds in proving non-termination.

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. Bruynooghe, M., Gallagher, J.P., Van Humbeeck, W.: Inference of well-typings for logic programs with application to termination analysis. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 35–51. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Debray, S.K., López-García, P., Hermenegildo, M.V.: Non-failure analysis for logic programs. In: ICLP, pp. 48–62 (1997)

    Google Scholar 

  3. Leuschel, M.: Logic program specialisation. In: Hatcliff, J., Thiemann, P. (eds.) DIKU 1998. LNCS, vol. 1706, pp. 155–188. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)

    Book  MATH  Google Scholar 

  5. Nguyen, M.T., Bruynooghe, M., De Schreye, D., Leuschel, M.: Program specialisation as a preprocessing step for termination analysis. In: Geser, A., Sondergaard, H. (eds.) WST 2006, pp. 7–11 (2006)

    Google Scholar 

  6. Payet, É., Mesnard, F.: Nontermination inference of logic programs. ACM Transactions on Programming Languages and Systems 28(2), 256–289 (2006)

    Article  Google Scholar 

  7. De Schreye, D., Decorte, S.: Termination of logic programs: The never-ending story. J. Log. Program. 19(20), 199–260 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Shen, Y.-d., de Schreye, D., Voets, D.: Termination prediction for general logic programs. Theory Pract. Log. Program. 9(6), 751–780 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Voets, D., De Schreye, D.: A new approach to non-termination analysis of logic programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 220–234. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Yardeni, E., Shapiro, E.Y.: A type system for logic programs. J. Log. Program. 10(1/2/3&4), 125–153 (1991)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, 3001, Heverlee, Belgium

    Dean Voets & Danny De Schreye

Authors
  1. Dean Voets
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danny De Schreye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ELP-DSIC, U. Politécnica de Valencia, Spain

    María Alpuente

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voets, D., De Schreye, D. (2011). Non-termination Analysis of Logic Programs Using Types. In: Alpuente, M. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2010. Lecture Notes in Computer Science, vol 6564. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20551-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20551-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20550-7

  • Online ISBN: 978-3-642-20551-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation