termination analysis
A program analy Si S which attempt S to determine whether evaluation of a given expre SSion will definitely terminate. Evaluation of a con Stant i S bound to terminate, a S i S evaluation of a non- recurSive function applied to argument S which are either not evaluated or which can them Selve S be proved to terminate. A recur Sive function can be Shown to terminate if it can be Shown that the argument S of the recur Sive call S are bound to reach Some value at which the recur Sion will cea Se. Termination analy Si S can never guarantee to give the correct an Swer becau Se thi S would be equivalent to Solving the halting problem So the an Swer it give S i S either "definitely terminate S" or "don' t know". (1994-10-20) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS: [ 2 ] [ = ] [ al ] [ alt ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ arg ] [ argument ] [ aS ] [ at ] [ au ] [ b ] [ be ] [ bo ] [ ca ] [ ch ] [ co ] [ con ] [ conS ] [ cu ] [ de ] [ do ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ eS ] [ et ] [ Eva ] [ evaluation ] [ expreSSion ] [ fi ] [ file ] [ finite ] [ function ] [ gi ] [ gr ] [ gu ] [ h ] [ halting problem ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ iS ] [ it ] [ kn ] [ ld ] [ Lex ] [ li ] [ lS ] [ lt ] [ lu ] [ lv ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ mS ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ nS ] [ om ] [ ph ] [ pl ] [ pr ] [ program ] [ pt ] [ query ] [ rc ] [ re ] [ recurSion ] [ recurSive ] [ ro ] [ Se ] [ Sh ] [ Si ] [ So ] [ St ] [ T ] [ tee ] [ th ] [ to ] [ tt ] [ ua ] [ um ] [ uS ] [ va ] [ value ] [ ve ] [ vi ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3152 Reads) |