A safe program analysis is one which will not reach invalid conclusions about the behaviour of the program. This may involve making safe approximations to properties of parts of the program. A safe approximation is one which gives less information. For example, strictness analysis aims to answer the question "will this function 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 functions which evaluate their argument" and "all functions". A set can be safely approximated by another which 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 ]