|Dynamic Memory Allocation Analysis email@example.com (Marco Antoniotti) (1999-05-29)|
|Re: Dynamic Memory Allocation Analysis firstname.lastname@example.org.STOPSPAM (Lars Clausen) (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis email@example.com (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis firstname.lastname@example.org (Torben Mogensen) (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis email@example.com (Marco Antoniotti) (1999-06-02)|
|Re: Dynamic Memory Allocation Analysis firstname.lastname@example.org (1999-06-03)|
|From:||email@example.com (George Neuner)|
|Date:||3 Jun 1999 02:23:17 -0400|
|Organization:||Dynamic ReSolutions, Inc.|
|Keywords:||storage, analysis, bibliography|
On 29 May 1999 01:07:30 -0400, Marco Antoniotti
>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.
Here are a number of good (though esoteric) papers on static analysis
of heap allocation that focus on lifetime determination and source
transformations to explicitly handle (de)allocation in systems that
are normally GC'd.
"Implementation of the Typed Call-by-Value Lambda Calculus using
a Stack of Regions", Tofte & Talpin, ACM POPL, 1994.
"Better Static Memory Management: Improving Region-Based Analysis
of Higher Order Languages", Aiken, Fahndrich & Levien,
ACM SIGPLAN '95.
"Experiences with Compiler-Directed Storage Reclamation",
James Hicks, ACM FPCA '93.
I haven't completely deciphered the first two yet, but their aim is to
eventually replace GC entirely with explicit deallocation.
Dynamic Resolutions, Inc.
Return to the
Search the comp.compilers archives again.