Journal of Automated Reasoning

, Volume 47, Issue 2, pp 133–160

Proving Termination by Dependency Pairs and Inductive Theorem Proving

  • Carsten Fuhs
  • Jürgen Giesl
  • Michael Parting
  • Peter Schneider-Kamp
  • Stephan Swiderski
Article

DOI: 10.1007/s10817-010-9215-9

Cite this article as:
Fuhs, C., Giesl, J., Parting, M. et al. J Autom Reasoning (2011) 47: 133. doi:10.1007/s10817-010-9215-9

Abstract

Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is essentially due to an inductive argument. Therefore, we show how to couple the dependency pair method for termination of TRSs with inductive theorem proving. As confirmed by the implementation of our new approach in the tool AProVE, now TRS termination techniques are also successful on this important class of algorithms.

Keywords

TerminationTerm rewritingInductionDependency pairs

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Carsten Fuhs
    • 1
  • Jürgen Giesl
    • 1
  • Michael Parting
    • 1
  • Peter Schneider-Kamp
    • 2
  • Stephan Swiderski
    • 1
  1. 1.LuFG Informatik 2RWTH Aachen UniversityAachenGermany
  2. 2.Department of Mathematics & Computer ScienceUniversity of Southern DenmarkOdenseDenmark