Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
 

Summary: Termination Analysis by Dependency Pairs and
Inductive Theorem Proving
S. Swiderski1
, M. Parting1
, J. Giesl1
, C. Fuhs1
, and P. Schneider-Kamp2
1
LuFG Informatik 2, RWTH Aachen University, Germany
2
Dept. of Mathematics & CS, University of Southern Denmark, Odense, Denmark
Abstract. Current techniques and tools for automated termination
analysis of term rewrite systems (TRSs) are already very powerful. How-
ever, they fail for algorithms whose termination is essentially due to
an inductive argument. Therefore, we show how to couple the depen-
dency pair method for TRS termination with inductive theorem prov-
ing. 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.
1 Introduction

  

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

 

Collections: Computer Technologies and Information Sciences