TY - GEN
T1 - Combining norms to prove termination
AU - Genaim, Samir
AU - Codish, Michael
AU - Gallagher, John
AU - Lagoon, Vitaly
PY - 2002/1/1
Y1 - 2002/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84894629636&partnerID=8YFLogxK
U2 - 10.1007/3-540-47813-2_9
DO - 10.1007/3-540-47813-2_9
M3 - Conference contribution
AN - SCOPUS:84894629636
SN - 3540436316
SN - 9783540436317
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 126
EP - 138
BT - Verification, Model Checking, and Abstract Interpretation - Third International Workshop, VMCAI 2002, Revised Papers
A2 - Cortesi, Agostino
PB - Springer Verlag
T2 - 3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI 2002
Y2 - 21 January 2002 through 22 January 2002
ER -