Optimized Live Heap Bound Analysis
STATE UNIV OF NEW YORK AT STONY BROOK DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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 improve the analysis efficiency. The analyses have been implemented and experimental results confirm their accuracy and efficiency.
- Computer Programming and Software
- Computer Systems Management and Standards