| Date of talk: | 25 February 2005 |
| Type of talk: | Doctoral Research Seminar Department of Computer Science & Engineering Washington University in St. Louis |
Dynamic allocation, and dynamic allocation of arrays in particular, presents a problem for static analyses seeking to measure memory use. We apply static value range analysis, long used to eliminate unnecessary runtime array indexing checks, to bound the size of many dynamic array allocations. We show these discovered allocation bounds to have a significant impact on static analysis of a program's rate of memory allocation---a necessary parameter to certain, modern garbage collection algorithms.
This is an early report on work that will be published as a technical report.
Slides available in [ Gzipped PostScript ] [ PostScript ] [ PDF ]