MOVES Seminar, 27 Apr 2009, 10:00

 

Termination Analysis with Dependency Pairs using Inductive Theorem Proving

 

Michael Parting

 

Abstract.

 

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