Skip to main content
SpringerLink
Log in

Automated termination proofs with measure functions

  • Logic and Reasoning
  • Conference paper
  • First Online:
KI-95: Advances in Artificial Intelligence (KI 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 981))

Included in the following conference series:

Abstract

This paper deals with the automation of termination proofs for recursively defined algorithms (i.e. algorithms in a pure functional language). Previously developed methods for their termination proofs either had a low degree of automation or they were restricted to one single fixed measure function to compare data objects. To overcome these drawbacks we introduce a calculus for automated termination proofs which is able to handle arbitrary measure functions based on polynomial norms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Ben Cherifa & P. Lescanne. Termination of Rewriting Systems by Polynomial Interpretations and its Implementation. Science of Computer Programming, 9(2):137–159, 1987.

    Google Scholar 

  2. E. Bevers & J. Lewi. Proving Termination of (Conditional) Rewrite Systems. Acta Informatica, 30:537–568, 1993.

    Google Scholar 

  3. R. S. Boyer & J S. Moore. A Computational Logic. Academic Press, 1979.

    Google Scholar 

  4. S. Decorte, D. De Schreye & M. Fabris. Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. In Proc. Int. Logic Programming Symp., Vancouver, Canada, 1993.

    Google Scholar 

  5. N. Dershowitz. Termination of Rewriting. Journal of Symbolic Computation, 3(1, 2):69–115, 1987.

    Google Scholar 

  6. J. Giesl. Generating Polynomial Orderings for Termination Proofs. Proc. 6th Int. Conf. Rewriting Tech. & Applications, Kaiserslautern, Germany, 1995.

    Google Scholar 

  7. J. Giesl. Termination Analysis for Functional Programs using Term Orderings. Proc. 2nd Int. Static Analysis Symposium, Glasgow, Scotland, 1995.

    Google Scholar 

  8. D. S. Lankford. On Proving Term Rewriting Systems are Noetherian. Technical Report Memo MTP-3, Louisiana Tech. Univ., Ruston, LA, 1979.

    Google Scholar 

  9. L. C. Paulson. Proving Termination of Normalization Functions for Conditional Expressions. Journal of Automated Reasoning, 2(1):63–74, 1986.

    Google Scholar 

  10. L. Plümer. Termination Proofs for Logic Programs. Springer, 1990.

    Google Scholar 

  11. J. Steinbach. Proving Polynomials Positive. In Proc. 12th Conf. Foundations Software Technology & Theoretical Comp. Sc., New Delhi, India, 1992.

    Google Scholar 

  12. C. Walther. Argument-Bounded Algorithms as as Basis for Automated Termination Proofs. Proc. 9th Int. Conf. Aut. Deduction, Argonne, Illinois, 1988.

    Google Scholar 

  13. C. Walther. On Proving the Termination of Algorithms by Machine. Artificial Intelligence, 71(1):101–157, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, Technische Hochschule Darmstadt, Alexanderstr. 10, 64283, Darmstadt, Germany

    Jürgen Giesl

Authors
  1. Jürgen Giesl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ipke Wachsmuth Claus-Rainer Rollinger Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giesl, J. (1995). Automated termination proofs with measure functions. In: Wachsmuth, I., Rollinger, CR., Brauer, W. (eds) KI-95: Advances in Artificial Intelligence. KI 1995. Lecture Notes in Computer Science, vol 981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60343-3_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-60343-3_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60343-6

  • Online ISBN: 978-3-540-44944-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation