|Dynamic Memory Allocation Analysis firstname.lastname@example.org (Marco Antoniotti) (1999-05-29)|
|Re: Dynamic Memory Allocation Analysis email@example.com.STOPSPAM (Lars Clausen) (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis firstname.lastname@example.org (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis email@example.com (Torben Mogensen) (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis firstname.lastname@example.org (Marco Antoniotti) (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis email@example.com (1999-06-03)|
|From:||Lars Clausen <firstname.lastname@example.org.STOPSPAM>|
|Date:||2 Jun 1999 01:37:37 -0400|
|Organization:||University of Illinois at Urbana-Champaign|
On 29 May 1999, email@example.com wrote:
> Could anybody point to work done on static (source level or lower)
> analysis of dynamic heap allocation.
> This is for a small study on GC profiling and most of the literature
> pointers I found is either about (1) GC algorithms, or (2) simulation
> based benchmarks of various GC schemes.
> The problem - giving a bound on the amount of memory allocated by a
> piece of code - is very hard (I'd say undecidable in the general
> case), but I'd like not to re-invent the wheel.
Laurie Hendren and the Sable group at McGill has done some work on
that, take a look at:
The general problem is undecidable, I'd agree.
Lars R. Clausen (http://shasta.cs.uiuc.edu/~lrclause) Hårdgrim of Westfield
Return to the
Search the comp.compilers archives again.