Termination analysis

From Wiki @ Karl Jones dot com
Revision as of 20:50, 20 September 2016 by Karl Jones (Talk | contribs) (Created page with "In computer science, a '''termination analysis''' is program analysis which attempts to determine whether the evaluation of a given computer program will definitel...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given computer program will definitely terminate.

Description

Because the halting problem is undecidable, termination analysis cannot be total.

The aim is to find the answer "program does terminate" (or "program does not terminate") whenever this is possible. Without success the algorithm (or human) working on the termination analysis may answer with "maybe" or continue working infinitely long.

See also

External links