the Garbage Collection Bibliography

This bibliography may be freely used for non-commercial purposes. It may also be freely distributed provided that this notice is included. I would be most grateful to receive additions, corrections and URLs of electronically available papers. The full bibliography is also available in compressed BibTeX (140k) and PDF forms.

Further GC-related material can be found on the Garbage Collection page.

Richard Jones

Copyright ©1996-2017 Richard Jones

Last updated 4 April 2017.

[A] [B] [C] [D] [E] [F] [G] [H] [I] [J] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] [X] [Y] [Z]


U


[ueda90] K. Ueda and M. Morita. A new implementation for flat GHC. In Warren and Szeredi [ICLP90], 1990, pages 3-17.


[ueno1] Katsuhiro Ueno, Atsushi Ohori, and Toshiaki Otomo. An efficient non-moving garbage collector for functional languages. In ICFP 2011 [ICFP11], 2011, pages 196-208. Available here.


[ugaw10] Tomoharu Ugawa, Hideya Iwasaki, and Taiichi Yuasa. Improved replication-based incremental garbage collection for embedded systems. In Vitek and Lea [ISMM10], 2010, pages 73-82. Available here.


[ugaw10b] Tomoharu Ugawa, Hideya Iwasaki, and Taiichi Yuasa. Starvation-free heap size for replication-based incremental compacting garbage collection. In International Conference on Lisp, pages 43-52, Reno/Sparks, NV, October 2010. Available here.


[ugaw10c] Tomoharu Ugawa, Hideya Iwasaki, and Taiichi Yuasa. Improvements of recovery from marking stack overflow in mark sweep garbage collection. IPSJ Online Transactions, 5, 2012.


[ugaw14] Tomoharu Ugawa, Richard Jones, and Carl G. Ritson. Reference object processing in on-the-fly garbage collection. In Guyer and Grove [ISMM14], 2014, pages 59-69. Available here.


[unga09] David M. Ungar and S.S. Adams. Hosting an object heap on many-core hardware: an exploration. In 5th Symposium on Dynamic Languages, pages 99-110, 2009.


[unga88] David M. Ungar and Frank Jackson. Tenuring policies for generation-based storage reclamation. In OOPSLA 1988 [OOPSLA88], 1988, pages 1-17. Available here.


[unga91] David M. Ungar and Frank Jackson. Outwitting GC devils: A hybrid incremental garbage collector. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.


[unga92] David M. Ungar and Frank Jackson. An adaptive tenuring policy for generation scavengers. ACM Transactions on Programming Languages and Systems, 14(1):1-27, 1992. Available here.


[unga83] David M. Ungar and David A. Patterson. Berkeley Smalltalk: Who knows where the time goes?. In Krasner [Smalltalk-BHWA], 1983, pages 189-206.


[unga84] David M. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In ACM/SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, ACM SIGPLAN Notices 19(5), pages 157-167, Pittsburgh, PA, April 1984. ACM Press. Available here.


[unga86] David M. Ungar. The Design and Evaluation of a High Performance Smalltalk System. {ACM distinguished dissertation 1986. MIT Press, 1986.


[ungu97] Christian Ungureanu and Benjamin Goldberg. Formal models of distributed memory management. In ICFP 1997 [ICFP97], 1997, pages 280-291. Available here.


[unni00] Leena Unnikrishnan, Scott D. Stoller, and Yanhong A. Liu. Automatic accurate stack space and heap space analysis for high-level languages. Technical Report 538, Indiana University, April 2000. Available here.


[unni01] Leena Unnikrishnan, Scott D. Stoller, and Yanhong A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In LCTES 2001 [LCTES01], 2001, pages 102-111. Available here.


[unni01a] Leena Unnikrishnan, Scott D. Stoller, and Yanhong A. Liu. Optimized live heap bound analysis. Technical Report DAR 01-2, SUNY at Stony Brook, October 2001. Available here.


[unni09] Leena Unnikrishnan and Scott D. Stoller. Parametric heap usage analysis for functional programs. In Kolodner and Steele [ISMM09], 2009, pages 139-148. Available here.

Up [A] [B] [C] [D] [E] [F] [G] [H] [I] [J] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] [X] [Y] [Z]


This file was generated by bib2htmlwritten by
Richard Jones

University of Kent at Canterbury