Abstract
This paper describes a general approach for automatic and accurate live heap space and live heap space-bound analyses for high-level languages. The approach is based on program analysis and transformations and is fully automatic. The space-bound analysis produces accurate (tight) upper bounds in the presence of partially known input structures. The analyses have been implemented and experimental results confirm their accuracy. Copyright ACM 2001.
| Original language | English |
|---|---|
| Pages (from-to) | 102-111 |
| Number of pages | 10 |
| Journal | SIGPLAN Notices (ACM Special Interest Group on Programming Languages) |
| Volume | 36 |
| Issue number | 8 |
| DOIs | |
| State | Published - Aug 2001 |
Fingerprint
Dive into the research topics of 'Automatic accurate live memory analysis for garbage-collected languages'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver