Related articles |
---|
Dynamic Memory Allocation Analysis marcoxa@parades.rm.cnr.it (Marco Antoniotti) (1999-05-29) |
Re: Dynamic Memory Allocation Analysis lrclause@cs.uiuc.edu.STOPSPAM (Lars Clausen) (1999-06-02) |
Re: Dynamic Memory Allocation Analysis ast@halcyon.com (1999-06-02) |
Re: Dynamic Memory Allocation Analysis torbenm@diku.dk (Torben Mogensen) (1999-06-02) |
Re: Dynamic Memory Allocation Analysis marcoxa@copernico.parades.rm.cnr.it (Marco Antoniotti) (1999-06-02) |
Re: Dynamic Memory Allocation Analysis gneuner@dyn.com (1999-06-03) |
From: | Lars Clausen <lrclause@cs.uiuc.edu.STOPSPAM> |
Newsgroups: | comp.compilers |
Date: | 2 Jun 1999 01:37:37 -0400 |
Organization: | University of Illinois at Urbana-Champaign |
References: | 99-05-143 |
Keywords: | storage |
On 29 May 1999, marcoxa@parades.rm.cnr.it 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:
http://www.sable.mcgill.ca/~hendren/pubs.html
The general problem is undecidable, I'd agree.
-Lars
--
Lars R. Clausen (http://shasta.cs.uiuc.edu/~lrclause) Hårdgrim of Westfield
Return to the
comp.compilers page.
Search the
comp.compilers archives again.