Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Termination Prover AProVE Jurgen Giesl, Ren e Thiemann, Peter Schneider-Kamp, Stephan Falke
 

Summary: The Termination Prover AProVE
Jurgen Giesl, Rene Thiemann, Peter Schneider-Kamp, Stephan Falke
LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany
fgiesl|thiemanng@informatik.rwth-aachen.de
fnowonder|spfg@i2.informatik.rwth-aachen.de
Abstract. We describe the system AProVE, an automated prover to
verify (innermost) termination of term rewrite systems (TRSs), func-
tional programs, and logic programs. For this system, we have developed
and implemented eĂcient algorithms based on classical simpli cation
orders (recursive path orders with status, Knuth-Bendix orders, polyno-
mial orders), dependency pairs, and the size-change principle. In AProVE,
termination proofs can be performed with a user-friendly graphical in-
terface and the system is currently among the most powerful termination
provers available.
1 Introduction
The system AProVE (Automated Program Veri cation Environment) can be
used for automated termination and innermost termination proofs of (condi-
tional) term rewrite systems, as well as for termination proofs of functional and
logic programs. AProVE o ers a variety of techniques for automated termination
proofs: First of all, it provides eĂcient implementations of classical simpli ca-

  

Source: ┴brahßm, Erika - Fachgruppe Informatik, Rheinisch Westfńlische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences