Skip to main content
Article thumbnail
Location of Repository

Automated termination proofs with AProVE

By Jürgen Giesl, René Thiemann, Peter Schneider-kamp and Stephan Falke

Abstract

Abstract. We describe the system ProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient algorithms based on classical simplification orders, dependency pairs, and the size-change principle. In particular, it contains many new improvements of the dependency pair approach that make automated termination proving more powerful and efficient. In ProVE, termination proofs can be performed with a user-friendly graphical interface and the system is currently among the most powerful termination provers available. 1

Publisher: 2013-07-31
Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.306.4911
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://link.springer.com/conte... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.