Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

AProVE 1.2 : Automatic Termination Proofs in the Dependency Pair Framework #

Summary: AProVE 1.2 : Automatic Termination Proofs in the
Dependency Pair Framework #
J˜urgen Giesl, Peter Schneider­Kamp, Ren’e Thiemann
LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany
Abstract. AProVE 1.2 is one of the most powerful systems for auto­
mated termination proofs of term rewrite systems (TRSs). It is the first
tool which automates the new dependency pair framework [8] and there­
fore permits a completely flexible combination of di#erent termination
proof techniques. Due to this framework, AProVE 1.2 is also the first
termination prover which can be fully configured by the user.
1 Introduction
AProVE 1.2 (Automated Program Verification Environment) is a system for
automated termination and innermost termination proofs of TRSs. Its prede­
cessor AProVE 1.0 [7] already o#ered a variety of termination proof techniques.
However, there the techniques were applied in a fixed order which could not be
influenced by the user. AProVE 1.2 has been totally re­structured (and partly
re­implemented) to permit a completely modular combination of the available
termination techniques. This increase in modularity of the termination tech­
niques also increases the power of AProVE substantially. The theoretical basis


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


Collections: Computer Technologies and Information Sciences