Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Termination of Nested and Mutually Recursive Algorithms
 

Summary: Termination of Nested and Mutually Recursive
Algorithms 
Jurgen Giesl
FB Informatik, Technische Hochschule Darmstadt,
Alexanderstr. 10, 64283 Darmstadt, Germany
Email: giesl@inferenzsysteme.informatik.tu-darmstadt.de
Abstract
This paper deals with automated termination analysis for functional
programs. Previously developed methods for automated termination proofs
of functional programs often fail for algorithms with nested recursion and
they cannot handle algorithms with mutual recursion.
We show that termination proofs for nested and mutually recursive al-
gorithms can be performed without having to prove the correctness of the
algorithms simultaneously. Using this result, nested and mutually recur-
sive algorithms do no longer constitute a special problem and the existing
methods for automated termination analysis can be extended to nested
and mutual recursion in a straightforward way. We give some examples of
algorithms whose termination can now be proved automatically (including
well-known challenge problems such as McCarthy's f 91 function).
1 Introduction

  

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

 

Collections: Computer Technologies and Information Sciences