follow Dictionary.com

Stories We Like: A Guide to the Comma

termination analysis

termination analysis in Technology


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)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

Word of the Day

Word Value for termination

13
16
Scrabble Words With Friends