Dynamic Memory Allocation Analysis

Marco Antoniotti <marcoxa@parades.rm.cnr.it>
29 May 1999 01:07:30 -0400

          From comp.compilers
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)
| List of all articles for this month |
From: Marco Antoniotti <marcoxa@parades.rm.cnr.it>
Newsgroups: comp.compilers
Date: 29 May 1999 01:07:30 -0400
Organization: PARADES, Rome, ITALY
Keywords: storage, analysis, question

Hi,


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.


Thanks in advance
--
Marco Antoniotti ===========================================
PARADES, Via San Pantaleo 66, I-00186 Rome, ITALY
tel. +39 - 06 68 10 03 17, fax. +39 - 06 68 80 79 26
http://www.parades.rm.cnr.it/~marcoxa

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.