This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Compile Time Memory Leak Analyses
- To: amylaar at redhat dot com (Joern Rennecke)
- Subject: Re: Compile Time Memory Leak Analyses
- From: Joe Buck <jbuck at synopsys dot COM>
- Date: Mon, 16 Jul 2001 15:38:10 -0700 (PDT)
- Cc: kevina at users dot sourceforge dot net (Kevin Atkinson), gcc at gcc dot gnu dot org
> > I am not saying that it will be easy (especially the part of the automatic
> > tagging) however I defiantly think it is possible and would greatly reduce
> > memory problems in some programs.
>
> In thinking so, you defy Rice's theorem.
> Well, just because somebody has proven that something is not computable
> doesn't mean you have to believe him.
Not at all. Undecidability theorems mean only that an analysis routine
that tries to establish whether property P is true must return a
three-valued result (yes, no, and "I don't know"). gcc is full of
such code. If there are many cases where a definite answer can be
given, the tool can be useful.
After all, reachability is also undecidable, but we still eliminate dead
code.