Space Efficient Conservative Garbage Collection

ACM SIGPLAN Notices

Volumn 28, Issue 6, 1993, Pages 197-206

  Boehm, Hans Juergen ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976685912     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/173262.155109     Document Type: Article

References (25)

1. Standard X3.159-1989, American National Standard for Information Systems - Programming Language - C, American National Standards Institute, Inc.
2. Atkinson, Russ, Alan Demers, Carl Hauser, Christian Jacobi, Peter Kessler, and Mark Weiser, “Experiences Creating a Portable Cedar”, Proceedings of the ACM SIGPLAN 'S9 Conference on Programming Language Design and Implementation, BIGPLAN Notices 24, 7 (July 1989), pp. 322-329.
3. Bartlett, Joel F. “Compacting garbage collection with ambiguous roots”, Lisp Pointers 1, 6 (AprilJune 1988), pp. 3-12.
4. Bartlett, Joel F., Scheme C a Portable Schemeto-C Compiler, WRL Research Report 89/1, Digital Equipment Corporation Western Research Laboratory, January 1989.
5. Bartlett, Joel F., Mostly Copying Garbage Collection Picks Up Generations and C++, Technical Report TN-12, Digital Equipment Corporation Western Research Laboratory, October 1989.
6. Bekkers, Y., O. Ridoux, and L. Ungaro, “Dynamic Memory Management for Sequential Logic Programming Languages, Proceedings of the International Workshop on.Mernory ikfanagement, St. Male, France, September 1992?, Springer LNCS 637, pp. 82-102.
7. Boehm, Hans-J., and David Chase, “A Proposal for Garbage-Collector-Safe C Compilation”, The Journal of C Language Translation 4, 2 (December 1992), pp. 126-141.
8. Boehm, H., A. Demers, and S. Shenker, “Mostly Parallel Garbage Collection”, Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, SIGPLAN Notices 26, 6 (June 1991), pp. 157-164.
9. Boehm, Hans-J. and Mark Weiser, “Garbage collection in an uncooperative environment”, Software Practice fj Ezperience 18, 9 (Sept. 1988), pp. 807-820.
10. Chailloux, Emmanuel, “A Conservative Garbage Collector with Ambiguous Roots for Static Typechecking Languages”, Proceedings of the International Workshop on Memory Management, St. Malo, France, September 1992, Springer LNCS 637, pp. 218-229.
11. Cridlig, Regis, “An Optimizing ML to C Compiler”, ACM SIGPLAN Workshop on ML and its Applications, San Franciscol June 1992, David MacQueen, chair.
12. A. Demers, M. Weiser, B. Hayes, H. Boehm, D. Bobrow, S. Shenker, “Combining Generational and Conservative Garbage Collection: Framework and Implementations”, Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, January 1990, pp. 261-269.
13. Detlefs, David L., “Concurrent Garbage Collection for C++”, in Advanced Programming Language Implementation, Peter Lee, ed., MIT Press, 1991.
14. Edelson, Daniel, “A Mark-and-Sweep Collector for C++”, Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 1992, pp. 51-58.
15. Goldberg, Benjamin, and Michael Gloger, “Polymorphic Type Reconstruction for Garbage Collection without Tags”, Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, pp. 53-65.
16. Hastings, Reed, and Bob Joyce, “Fast Detection of Memory Leaks and Access Errors”, Proceedings of the Winter '92 USENIX conference, pp. 125-136.
17. Omohundro, Stephen M., The Sather Language, ICSI, Berkeley, 1991.
18. Rose, John R., and Hans Muller, “Integrating the Scheme and C languages”, Proceedings of the 1992 A CM Conference on Lisp and Functional Programming, pp. 247-259.
19. Rovner, Paul, “On Adding Garbage Collection and Runtime Types to a Strongly-Typed Statically Checked, Concurrent Language”, Technical Report CSL-84-7, Xerox Palo Alto Research Center, Palo Alto, CA, July 1985.
20. Ungar, David M., “Generation Scavenging: A NonDisruptive High Performance Storage Reclamation Algorithm”, ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, SIGPLAN Notices 19, 5 (May 1984), pp. 157-167.
21. Schelter, W. F., and M. Ballantyne, “Kyoto Common Lisp”, AI Ezpert 33 (1988), pp. 75-77.
22. Weiser, Mark, Alan Demers, and Carl Hauser, “The Portable Common Runtime Approach to Interoperability”, Proceedings 13th ACM Symposium on Operating Systems Principles, December 1989.
23. Wentworth, E. P., “Pitfalls of Conservative Garbage Collection”, Software Practice of Ezperience 20, 7 (July 1990) pp. 719-727.
24. Wilson, Paul R., “Uniprocessor Garbage Collection Techniques”, Proceedings of the International Workshop on Memory Management, St. Malo, France, September 1992, Springer LNCS 637, pp. 1-42.
25. Zorn, Benjamin, “The Measured Cost of Conservative Garbage Collection”, University of Colorado at Boulder, Department of Computer Science Technical Report CU-CS-573-92.