safe
A safe program analysis is one whi Ch will not rea Ch invalid Con Clusions about the behaviour of the program. This may involve making safe approximations to properties of parts of the program. A safe approximation is one whi Ch gives less information. For example, stri Ctness analysis aims to answer the question "will this fun Ction evaluate its argument"?. The two possible results are "definitely" and "don' t know". A safe approximation for "definitely" is "don' t know". The two possible results Correspond to the two sets: "the set of all fun Ctions whi Ch evaluate their argument" and "all fun Ctions". A set Can be safely approximated by another whi Ch Contains it. In addition suitable Contents: [ af ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arg ] [ argument ] [ at ] [ av ] [ b ] [ be ] [ bo ] [ by ] [ Ca ] [ Ch ] [ Cl ] [ Co ] [ Con ] [ de ] [ do ] [ ed ] [ eh ] [ er ] [ es ] [ et ] [ fi ] [ finite ] [ fo ] [ for ] [ funCtion ] [ gi ] [ gr ] [ gu ] [ h ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ ki ] [ kn ] [ li ] [ lt ] [ lu ] [ lv ] [ ly ] [ ma ] [ mp ] [ ms ] [ na ] [ nC ] [ ne ] [ nf ] [ ng ] [ ni ] [ no ] [ ns ] [ op ] [ pa ] [ pe ] [ pl ] [ pr ] [ program ] [ ques ] [ re ] [ ro ] [ sa ] [ se ] [ set ] [ si ] [ st ] [ striCt ] [ su ] [ T ] [ th ] [ tn ] [ to ] [ tr ] [ tw ] [ ua ] [ um ] [ us ] [ va ] [ ve ] [ vi ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3462 Reads) |