Re: Super Lint (was: Unexecutable Stack / Buffer Overflow

[Jeff Dike]

> I'm not sure that the well-known theoretical insolubility of the
> halting problem implies that one cannot formally and tractably
> compute other meaningful and useful execution properties of an
> arbitrary procedural program. 

It does mean that there are cases (in principle) where computing execution 
properties of a program is exquivalent to the halting problem.  You can encode 
anything you want in terms of a halting problem.

I haven't worried about this because:
	there aren't going to be too many halting problems in typical code
	there shouldn't be any halting problems in your code anyway

				Jeff