Termination analysis
A program analysis which attempts to determine whether evaluation of a given expression will definitely terminate.
Evaluation of a constant is bound to terminate, as is evaluation of a non-recursive function applied to arguments which are either not evaluated or which can themselves be proved to terminate. A recursive function can be shown to terminate if it can be shown that the arguments of the recursive calls are bound to reach some value at which the recursion will cease.
Termination analysis can never guarantee to give the correct answer because this would be equivalent to solving the halting problem so the answer it gives is either “definitely terminates” or “don’t know”.
(1994-10-20)
Read Also:
- Termination codon
termination codon (tûr’mə-nā’shən) See stop codon.
- Terminator
noun 1. a person or thing that terminates. 2. Astronomy. the dividing line between the illuminated and the unilluminated part of a satellite or planet, especially the moon. noun 1. the line dividing the illuminated and dark part of the moon or a planet electronics A resistor connected to a signal wire in a bus […]
- Terminator seed
noun 1. a seed that produces sterile plants, used in some genetically modified crops so that a new supply of seeds has to be bought every year
- Terminatory
adjective 1. pertaining to or forming the extremity or boundary; terminal; terminating.
- Term infant
term infant n. An infant born between the end of the 37th week and the end of the 42nd week of gestation.