Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Automated Termination Proofs with AProVE Jurgen Giesl, Rene Thiemann, Peter Schneider-Kamp, Stephan Falke
 

Summary: Automated Termination Proofs with AProVE
J¨urgen Giesl, Ren´e Thiemann, Peter Schneider-Kamp, Stephan Falke
LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany
{giesl|thiemann|psk}@informatik.rwth-aachen.de
spf@i2.informatik.rwth-aachen.de
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 efficient algorithms based
on classical simplification orders, dependency pairs, and the size-change
principle. In particular, it contains many new improvements of the de-
pendency pair approach that make automated termination proving more
powerful and efficient. 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.
1 Introduction
The system AProVE (Automated Program Verification Environment) offers a va-
riety of techniques for automated termination proofs of TRSs: First, it provides
efficient implementations of classical simplification orders to prove termination
"directly" (recursive path orders possibly with status [6, 19], Knuth-Bendix or-
ders [20], and polynomial orders [22]), cf. Sect. 2. To increase the power of auto-

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences