Bounding space usage of conservative garbage collectors

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 93-100

  Boehm, Hans J ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA STORAGE EQUIPMENT; DATA STRUCTURES; STORAGE ALLOCATION (COMPUTER);

AUTOMATIC MEMORY RECLAMATION; CONSERVATIVE GARBAGE COLLECTORS; RUN TIME SYSTEMS;

PROGRAMMING THEORY;

EID: 0036038628     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503282     Document Type: Conference Paper

References (16)

1. Mostly accurate stack scanning
2. Compacting garbage collection with ambiguous roots
3. Space efficient conservative garbage collection
4. Safety considerations for storage allocation optimization
5. Proper tail recursion and space efficiency
6. On the type accuracy of garbage collection
7. Incremental collection of mature objects
8. An estimate of the store size necessary for dynamic storage allocation
9. Bounds for some functions concerning dynamic storage allocation
10. Generational garbage collection without temporary space leaks
11. Understanding memory allocation of Scheme programs
12. The portable common runtime approach to interoperability
13. Pitfalls of conservative garbage collection