Automated Termination Proofs with AProVE (2004)
Cached
Download Links
| Venue: | In RTA’2004: Rewriting Techniques and Applications, volume 3091 of LNCS |
| Citations: | 47 - 6 self |
BibTeX
@INPROCEEDINGS{Giesl04automatedtermination,
author = {Jürgen Giesl and René Thiemann and Peter Schneider-kamp and Stephan Falke},
title = {Automated Termination Proofs with AProVE},
booktitle = {In RTA’2004: Rewriting Techniques and Applications, volume 3091 of LNCS},
year = {2004},
pages = {210--220},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented effcient 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 effcient. In AProVE, termination proofs can be performed with a user-friendly graphical interface and the system is currently among the most powerful termination provers available.
