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
Further GC-related material can be found on
the Garbage Collection page.
Last updated 3 April 2018.
[yama98] Hirotaka Yamamoto, Kenjiro Taura, and Akinori Yonezawa.
Comparing reference counting and global mark-and-sweep on parallel
In Languages, Compilers, and Run-time Systems (LCR), Lecture Notes in
Computer Science. Springer-Verlag, May 1998.
[yama98a] Hirotaka Yamamoto, Kenjiro Taura, and Akinori Yonezawa.
Performance comparison between reference counting and global GC on
distributed-memory parallel computers.
In Joint Symposium on Parallel Processing (JSPP), June 1998.
[yang02] Qian Yang, Witawas Srisa-an, Therapon Skotiniotis, and J. Morris Chang.
Java virtual machine probes - a study of object life span and GC.
In 21st IEEE International Performance, Computing and Communications
Conference (IPCCC), Phoenix, AZ, April 2002.
[yang04] Ting Yang, Emery D. Berger, Matthew Hertz, Scott F. Kaplan, and J. Eliot B.
Autonomic heap sizing: Taking real memory into account.
In Bacon and Diwan [ISMM04], 2004, pages 61-72.
[yang06] Ting Yang, Emery D. Berger, Scott F. Kaplan, and J. Eliot B. Moss.
CRAMM: Virtual memory support for garbage-collected applications.
In 7th USENIX Symposium on Operating System Design and
Implementation, pages 103-116, Seattle, WA, November 2006. USENIX
[yang10] Wuu Yang, Huei-Ru Tseng, and Rong-Hang Jan.
Heap garbage collection with reference counting.
In Fifth International Conference on Software and Data Technologies,
Athens, Greece, July 2010.
[yang11] Xi Yang, Stephen M. Blackburn, Daniel Frampton, Jennifer B. Sartor, and
Kathryn S. McKinley.
Why nothing matters: The impact of zeroing.
In OOPSLA 2011 [OOPSLA11], 2011, pages 307-324.
[yang12] Xi Yang, Stephen M. Blackburn, Daniel Frampton, and Antony L. Hosking.
Barriers reconsidered, friendlier still!.
In McKinley and Vechev [ISMM12], 2012, pages 37-48.
[yang17] Albert Mingkun Yang and Tobias Wrigstad.
Type-assisted automatic garbage collection for lock-free data
In ISMM 2017 [ISMM17], 2017, pages 14-24.
[yang01] Hongseok Yang.
An example of local reasoning in BI pointer logic: the Schorr-Waite
graph marking algorithm.
In SPACE 2001 [SPACE01], 2001.
[yang01a] Hongseok Yang.
Local Reasoning for Stateful Programs.
PhD thesis, University of Illinois at Urbana-Champaign, 2001.
[yasu91] Masahiro Yasugi and Akinori Yonezawa.
Towards user (application) language-level garbage collection in
object-oriented concurrent languages.
In Wilson and Hayes [OOPSLA91-gc], 1991.
[ye97] Xinfeng Ye and John Keane.
Collecting cyclic garbage in distributed systems.
In International Symposium on Parallel Architectures, Algorithms and
Networks (ISPAN '97), Taipei, Taiwan, December 1997.
[yeat97b] Stuart A. Yeates and Michel de Champlain.
Design of a garbage collector using design patterns.
In Christine Mingins, Roger Duke, and Bertrand Meyer, editors, 25th
Conference of TOOLS Pacific., pages 77-92, Melbourne, 1997. ISE
(Interactive Software Engineering).
[yeat97] Stuart A. Yeates and Michel de Champlain.
Design patterns in garbage collection.
In Robert S. Hanmer and Don Roberts, editors, 4th Annual Conference on the
Pattern Languages of Programs, volume 6 ``General Techniques'',
Monticello, IL, 2-5 September 1997.
Published as technical report # WUCS-97-34 of Washington University (not peer
[yeat97a] Stuart Yeates.
Design patterns in garbage collection.
Master's thesis, University of Canterbury, Christchurch, New Zealand, June
[yelo77] L. Yelowitz and A. G. Duncan.
Abstractions, instantiations and proofs of marking algorithms.
ACM SIGPLAN Notices, 12(8):13-21, August 1977.
[yi92] Kwangkeun Yi and Williams Ludwell Harrison III.
Interprocedural data flow analysis for compile-time memory management.
Technical Report 1244, Center for Supercomputing Research and Development,
University of Illinois, August 1992.
[yip91] G. May Yip.
Incremental, generational mostly-copying garbage collection in uncooperative
Technical Report 91/8, Digital, Western Research Laboratory, June 1991.
Masters Thesis - MIT, Cambridge, MA, 1991.
[yong94] V.-F. Yong and J. Naughton amd J.-B. Yu.
Storage reclamation and reorganization in client-server persistent object
In International Conference on Data Engineering, pages 120-133,
Houston, TX, February 1994.
[yu03] Dachuan Yu, Nadeem A. Hamid, and Zhong Shao.
Building certified libraries for PCC: Dynamic storage allocation.
In Degano [ESOP03], 2003, pages 101-127.
[yu08] Zoe C. H. Yu, Francis C. M. Lau, and Cho-Li Wang.
Object co-location and memory reuse for Java programs.
ACM Transactions on Architecture and Code Optimization, 4(4):1-36,
[yu96] W. Yu and A. Cox.
Conservative garbage collection on distributed shared memory system.
In 6th International Conference on Distributed Computing Systems
(ICDCS), pages 402-410, May 1996.
[yuas85] Taiichi Yuasa and Masumi Hagiya.
Kyoto Common Lisp report.
Technical report, Teikoku Insatsu Publishing, Kyoto, 1985.
[yuas90] Taiichi Yuasa.
Real-time garbage collection on general-purpose machines.
Journal of Systems and Software, 11(3):181-198, March 1990.
[yuas92] Taiichi Yuasa.
Memory management and garbage collection of an extended Common Lisp
system for massively parallel SIMD architecture.
In Bekkers and Cohen [IWMM92], 1992, pages 490-506.
[yuas02] Taiichi Yuasa.
In International Lisp Conference, 2002.
[yuha86] M. Yuhara, A. Hattori, M. Niwa, M. Kishimoto, and H. Hayashi.
Evaluation of the Facom Alpha Lisp machine..
In 13th Annual International Symposium on Computer Architecture,
Tokyo, June 1986. IEEE Press.
[yung10] Chung Yung, Jheng-Jyun Syu, and Shiang-Yu Yang.
A graph-based algorithm of mostly incremental garbage collection for active
In International Computer Symposium (ICS), pages 988-996. IEEE
This file was generated by
University of Kent at Canterbury