Combining norms to prove termination

Samir Genaim, Michael Codish, John Gallagher, Vitaly Lagoon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations


Automatic termination analysers typically measure the size of terms applying norms which are mappings from terms to the natural numbers. This paper illustrates how to enable the use of size functions defined as tuples of these simpler norm functions. This approach enables us to simplify the problem of deriving automatically a candidate norm with which to prove termination. Instead of deriving a single, complex norm function, it is sufficient to determine a collection of simpler norms, some combination of which, leads to a proof of termination. We propose that a collection of simple norms, one for each of the recursive data-types in the program, is often a suitable choice. We first demonstrate the power of combining norm functions and then the adequacy of combining norms based on regular types.

Original languageEnglish
Title of host publicationVerification, Model Checking, and Abstract Interpretation - Third International Workshop, VMCAI 2002, Revised Papers
EditorsAgostino Cortesi
PublisherSpringer Verlag
Number of pages13
ISBN (Print)3540436316, 9783540436317
StatePublished - 1 Jan 2002
Event3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI 2002 - Venice, Italy
Duration: 21 Jan 200222 Jan 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2294 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Combining norms to prove termination'. Together they form a unique fingerprint.

Cite this