This paper describes a general approach for optimized live heap space and live heap space-bound analyses for garbage-collected
languages. The approach is based on program analysis and transformations and is fully automatic. In our experience, the space-bound
analysis generally produces accurate (tight) upper bounds in the presence of partially known input structures. The optimization
drastically improves the analysis efficiency. The analyses have been implemented and experimental results confirm their accuracy
and efficiency.
The authors gratefully acknowledge the support of ONR under grants N00014- 99-1-0132, N00014-99-1-0358 and N00014-01-1-0109
and of NSF under grants CCR-9711253 and CCR-9876058. Authors’ address: Computer Science Department, SUNY at Stony Brook, Stony
Brook, NY 11794-4400 USA.