Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Automated Termination Proofs with Measure Functions ?
 

Summary: Automated Termination Proofs with
Measure Functions ?
J¨urgen Giesl
FB Informatik, Technische Hochschule Darmstadt,
Alexanderstr. 10, 64283 Darmstadt, Germany
Email: giesl@inferenzsysteme.informatik.th­darmstadt.de
Abstract. This paper deals with the automation of termination proofs
for recursively defined algorithms (i.e. algorithms in a pure functional
language). Previously developed methods for their termination proofs
either had a low degree of automation or they were restricted to one
single fixed measure function to compare data objects. To overcome these
drawbacks we introduce a calculus for automated termination proofs
which is able to handle arbitrary measure functions based on polynomial
norms.
1 Introduction
Termination of algorithms is a central problem in software development. For an
automation of program verification, termination proofs have to be performed
mechanically, i.e. without human support. Of course, as the halting problem
is undecidable, there is no procedure to prove or disprove termination of all
algorithms.

  

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

 

Collections: Computer Technologies and Information Sciences