left

Goal and Scope

right
AProVE Help SystemIntroductionGoal and Scope

The system AProVE can be used for automated termination and innermost termination proofs of (conditional) term rewrite systems (TRSs), Prolog programs, functional, and imperative programs. For more information see the section about the input languages accepted by AProVE. Furthermore, since version 1.2 AProVE contains a special mode for performing liveness proofs.

AProVE currently offers many transformation techniques, basic termination techniques (including recursive path orders, Knut Bendix orders, polynomial orders, RFC Matchbounds), dependency pairs including recent refinements such as narrowing, rewriting, and instantiation of dependency pairs, and the size-change principle, also in combination with dependency pairs.

The tool is written in Java and proofs can be performed both in a fully automated or in an interactive mode via a graphical user interface.