termination analysis
termination analysis
Evaluation of a constant is bound to terminate, as isevaluation of a non-recursive function applied to argumentswhich are either not evaluated or which can themselves beproved to terminate. A recursive function can be shown toterminate if it can be shown that the arguments of therecursive calls are bound to reach some value at which therecursion will cease.
Termination analysis can never guarantee to give the correctanswer because this would be equivalent to solving thehalting problem so the answer it gives is either "definitelyterminates" or "don't know".