, Volume 47, Issue 2, pp 133-160
Date: 15 Jan 2011

Proving Termination by Dependency Pairs and Inductive Theorem Proving

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is essentially due to an inductive argument. Therefore, we show how to couple the dependency pair method for termination of TRSs with inductive theorem proving. As confirmed by the implementation of our new approach in the tool AProVE, now TRS termination techniques are also successful on this important class of algorithms.

Supported by the DFG grant GI 274/5-3, the DFG Research Training Group 1298 (AlgoSyn), the G.I.F. grant 966-116.6, and the Danish Natural Science Research Council.