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-2010 Richard Jones

Last updated 29 July 2010.

[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]

A

[abdu93] Saleh E. Abdullah and E.J.A. Edemenang. A comparative study of dynamic memory management techniques. Advances in Modelling and Analysis, 15(2):17-31, 1993.

[abdu92a] Saleh E. Abdullah. Managing computer memory: Dynamic allocation and deallocation strategies. In Proceedings of Second Conference on Information Technology and its Applications, pages 25-40, Leicester, December 1992.

[abdu94] Saleh E. Abdullah. Recycling garbage. In Proceedings of Third Conference on Information Technology and its Applications, pages 192-197, Leicester, April 1994.

[abdu92] Saleh E. Abdullahi, Eliot E. Miranda, and Graem A. Ringwood. Distributed garbage collection. In Bekkers and Cohen [IWMM92], 1992. Available here.

[abdu96] Saleh E. Abdullahi and Graem A. Ringwood. Empirical studies of distributed garbage collection: Parts i, ii and iii. Technical report, Queen Mary and Westfield College, University of London, 1996.

[abdu96a] Saleh E. Abdullahi and Graem A. Ringwood. Garbage collecting the Internet. Technical report, Queen Mary and Westfield College, University of London, 1996? Draft version of [abdu98].

[abdu98] Saleh E. Abdullahi and Graem A. Ringwood. Garbage collecting the Internet: a survey of distributed garbage collection. ACM Computing Surveys, 30(3):330-373, September 1998. Available here.

[abdu95] Saleh E. Abdullahi. Empirical Studies of Distributed Garbage Collection. PhD thesis, Queen Mary and Westfield College, December 1995. Available here.

[abel96] Harold Abelson, Gerald Jay Sussman, and Julie Sussman. Structure and Interpretation of Computer Programs. MIT Press, second edition, 1996.

[abra87] Santosh Abraham and J. Patel. Parallel garbage collection on a virtual memory system. In International Conference on Parallel Processing, pages 243-246, University Park, Pennsylvania, USA, August 1987. Pennsylvania State University Press. Also technical report CSRD 620, University of Illinois at Urbana-Champaign, Center for Supercomputing Research and Development.

[abra67] John Abramowich. Storage allocation in a certain iterative process. Communications of the ACM, 10(6):368-370, June 1967.

[abua04] Diab Abuaiadh, Yoav Ossia, Erez Petrank, and Uri Silbershtein. An efficient parallel heap compaction algorithm. In OOPSLA 2004 [OOPSLA04], 2004, pages 224-236. Available here.

[acar06] Umut A. Acar, Guy E. Blelloch, M. Blume, and K. Tangwongsan. An experimental analysis of self-adjusting computation. In Schwartzbach and Ball [PLDI06], 2006, pages 96-107. Available here.

[acce86] M. Accetta, R. Baron, W. Bolosky, D. Golub, R. Rashid, A. Tevanian, and M. Young. Mach: A new kernel foundation for Unix development. In Proceedings of Usenix Summer Conference. USENIX Association, July 1986.

[adit94] Shail Aditya, Christine Flood, and James Hicks. Garbage collection for strongly-typed languages using run-time type reconstruction. In LFP 1994 [LFP94], 1994, pages 12-23. Available here.

[adji96] Cédric Adjih. Mesure et caractérisation d'applications réparties. Master's thesis, Université Paris Sud, 1996. Available here.

[adl98] Ali-Reza Adl-Tabatai, Michal Cierniak, Guei-Yuan Leuh, Vihesh M. Parikh, and James M. Stichnoth. Fast effective code generation in a Just-In-Time Java compiler. In PLDI 1998 [PLDI98], 1998, pages 280-290. Available here.

[adve95] Sarita V. Adve and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. WRL Research Report 95/7, Digital Western Research Laboratory, September 1995. Available here.

[adve96] Sarita V. Adve and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29(12):66-76, December 1996. Available here.

[aert81] J. P. H. Aerts. Implementing SASL without garbage collection. EUT Report 81-WSK-05, Eindhoven University of Technology, 1981.

[aft08] Edward Aftandilian and Samuel Guyer. GC assertions: Using the garbage collector to check heap properties. In MSPC 2008: ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, Seattle, WA, March 2008. Available here.

[aft09] Edward Aftandilian and Samuel Guyer. GC assertions: Using the garbage collector to check heap properties. In PLDI 2009 [PLDI09], 2009, pages 235-244. Available here.

[agar06] Kartik Agaram, Steve Keckler, Calvin Lin, and Kathryn McKinley. Decomposing memory performance: Data structures and phases. In Petrank and Moss [ISMM06], 2006, pages 95-103.

[agar88] Anant Agarwal, Mark Horowitz, and John Hennessy. Cache performance of operating systems and multiprogramming workloads. ACM Transactions on Computer Systems, 6(4):393-431, November 1988.

[agar87] Anant Agarwal. Analysis of Cache Performance for Operating Systems and Multiprogramming. PhD thesis, Stanford University, Palo Alto, CA, May 1987. Available as Technical Report CSL-TR-87-332.

[ages98] Ole Agesen, David Detlefs, and J. Eliot B. Moss. Garbage collection and local variable type-precision and liveness in Java virtual machines. In PLDI 1998 [PLDI98], 1998, pages 269-279. Available here.

[ages97] Ole Agesen and David Detlefs. Finding references in Java stacks. In Dickman and Wilson [OOPSLA97-gc], 1997. Available here.

[ages00] Ole Agesen and Alex Garthwaite. Efficient object sampling via weak references. In Chambers and Hosking [ISMM2000], 2000, pages 121-136.

[ages98a] Ole Agesen. GC points in a threaded environment. Technical Report SMLI TR-98-70, Sun Microsystems Laboratories, Palo Alto, CA, 1998. Available here.

[ages99] Ole Agesen. Space and time-efficient hashing of garbage-collected objects. Theory and Practice of Object Systems, 5(2):119-124, 1999. Available here.

[agga02] Aneesh Aggarwal. Software caching vs. prefetching.In Boehm and Detlefs [ISMM02], 2002, pages 157-162. Available here.

[aggo90] A. Aggoun and N. Beldiceanu. Time stamps techniques for the trailed data in constraint logic programming systems. In Séminaire de Programmation Logique de Trégastel, CNET, France, pages 487-509, 1990.

[agha86] G. Agha. Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, 1986.

[aho86] Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.

[aho88] Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

[aike95] Alex Aiken, Manuel Fähndrich, and Raph Levien. Better static memory management: Improving region-based analysis of higher-order languages. Technical report, University of California at Berkeley, 1995. Available here.

[aike95a] Alex Aiken, Manuel Fähndrich, and Raph Levien. Better static memory management: Improving region-based analysis of higher-order languages. In PLDI 1995 [PLDI95], 1995, pages 174-185. Available here.

[ait91] Hassan Aït-Kaci. The WAM: A (real) tutorial. In Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press, 1991. Also Technical report 5, DEC Paris Research Laboratory, 1990.

[AIX] Subroutines Overview, General Programming Concepts, AIX version 3.2 edition, version 3.2.

[akyu95] Sedat Akyürek and Kenneth Salem. Adaptive block rearrangement. ACM Transactions on Computer Systems, 13(2):95-121, May 1995.

[albe07] Elvira Albert, Samir Genaim, and Miguel Gómez-Zamalloa. Heap space analysis for Java bytecode. In Morrisett and Sagiv [ISMM07], 2007, pages 105-116.

[albe09] Elvira Albert, Samir Genaim, and Miguel Gómez-Zamalloa Gil. Live heap space analysis for languages with garbage collection. In Kolodner and Steele [ISMM09], 2009, pages 129-138. Available here.

[albe10] Elvira Albert, Samir Genaim, and Miguel Gómez-Zamalloa. Parametric inference of memory requirements for garbage collected languages. In jan Vitek and Lea [ISMM10], 2010, pages 121-130. Available here.

[ali98] K.A.M. Ali. A simple generational real-time garbage collection scheme. Computing Paradigms and Computational Intelligence (New Generation Computing), 16(2), 1998.

[alla91] J. R. Allard and L. B. Hawkinson. Real-time programming in Common Lisp. Communications of the ACM, 34(9):64-69, 1991.

[alli89] L. Allison. Circular programs and self-referential structures. Software Practice and Experience, 19(2):99-109, 1989.

[alme83] Guy Almes, A. Borning, and E. Messinger. Implementing a Smalltalk-80 system on the Intel 432. In Krasner [Smalltalk-BHWA], 1983, pages 175-187.

[alme80] Guy T. Almes. Garbage collection in an Object-Oriented System. PhD thesis, Carnegie Mellon University, 1980.

[alon87] Noga Alon, Amnon Barak, and Udi Mander. On disseminating information reliably without broadcasting. In Seventh International Conference on Distributed Computing Systems ICDCS97, Berlin, September 1987. IEEE Press.

[alon90] R. Alonso and Andrew W. Appel. Advisor for flexible working sets. In Proceedings of the 1990 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems. Boulder, May 22-25, pages 153-162. ACM Press, 1990.

[alpe99] Bowen Alpern, C. R. Attanasio, Anthony Cocchi, Derek Lieber, Stephen Smith, Ton Ngo, John J. Barton, Susan Flynn Hummel, Janice C. Sheperd, and Mark Mergen. Implementing Jalapeño in Java. In OOPSLA 1999 [OOPSLA99], 1999, pages 314-324. Available here.

[alpe00] Bowen Alpern, Dick Attanasio, John J. Barton, M. G. Burke, Perry Cheng, J.-D. Choi, Anthony Cocchi, Stephen J. Fink, David Grove, Michael Hind, Susan Flynn Hummel, D. Lieber, V. Litvinov, Mark Mergen, Ton Ngo, J. R. Russell, Vivek Sarkar, Manuel J. Serrano, Janice Shepherd, S. Smith, V. C. Sreedhar, H. Srinivasan, and J. Whaley. The Jalapeño virtual machine. IBM Systems Journal, 39(1), February 2000. Available here.

[alpe02] Bowen Alpern, Maria Butrico, Anthony Cocchi, Julian Dolby, Stephen Fink, David Grove, and Ton Ngo. Experiences porting the Jikes RVM to Linux/IA32. In JVM 2002 [JVM02], 2002. Available here.

[amad04] Roberto Amadio, Solange Coupet-Grimal, Silvano Dal Zilio, and Line Jakubiec. A functional scenerio for bytecode verification of space bounds. In SPACE 2004 [SPACE04], 2004. Available here.

[amam83] M. Amamiya, R. Hasegawa, and H. Mikami. List processing with a data flow machine. In Proceedings of RIMS Symposia on Software Science and Engineering, 1980-1982, volume 147 of Lecture Notes in Computer Science, pages 165-190, Kyoto, 1983. Springer-Verlag.

[amsa94] Laurent Amsaleg, Michael Franklin, and Olivier Gruber. Efficient incremental garbage collection for workstation/server database systems. Technical Report CS-TR-3370, University of Maryland, November 1994. Also University of Maryland Institute for Advanced Computer Studies report UMIACS-TR-94-121. Available here.

[amsa95a] Laurent Amsaleg, Paulo Ferreira, Michael Franklin, and Marc Shapiro. Evaluating garbage collectors for large persistent stores. In OOPSLA'95 Workshop on Object Database Behavior, Benchmarks, and Performance, Austin, TX, October 1995. Available here.

[amsa95] Laurent Amsaleg, Michael Franklin, and Olivier Gruber. Efficient incremental garbage collection for client-server object database systems. In Twenty-first International Conference on Very Large Databases (VLDB95), Zurich, Switzerland, September 1995. Available here.

[amsa99] Laurent Amsaleg, Michael Franklin, and Olivier Gruber. Garbage collection for a client-server persistent object store. ACM Transactions on Computer Systems, 17(3):153-201, 1999.

[amst00] Jonathan Amsterdam. Use object pools to sidestep garbage collection. Java Report, pages 120-119 (really), September 2000.

[ande87] Wayne Anderson, William Galway, Robert Kessler, Herbert Melenk, and Winfried Neun. The implementation and optimisation of Portable Standard Lisp for the Cray. In 20th Annual Hawaii International Conference on Science Systems, January 1987.

[ande91] Thomas E. Anderson, Henry M. Levy, Brian N. Bershad, and Edward D. Lazowska. The interaction of architecture and operating systems design. In ASPLOS 1991 [ASPLOS91], 1991, pages 108-120.

[ande04] T. Anderson, M. Eng, N. Glew, B. Lewis, V. Menon, and J Stichnoth. Experience integrating a new compiler and garbage collector into Rotor. In .NET Technologies'2004, 2004. Available here.

[ande10] Todd A. Anderson. Optimizations in a private nursery-based garbage collector. In jan Vitek and Lea [ISMM10], 2010, pages 21-30. Available here.

[andr86] David L. Andre. Paging in Lisp programs. Master's thesis, University of Maryland, College Park, Maryland, 1986.

[andr02] Eva Andreasson, Frank Hoffmann, and Olof Lindholm. To collect or not to collect? machine learning for memory management. In JVM 2002 [JVM02], 2002. Available here.

[ANSI-C] American National Standards Institute. American National Standard for Information Systems: Programming Language C, December 1989.

[ANSI-C++] ANSI document X3J16/95-0087, ISO document WG21/N0618. Draft Proposed International Standard for Information SSystems: Programming Language C++, April 1995.

[aonix] The PERC virtual machine. http://www.aonix.com. Available here.

[appe88c] Andrew W. Appel, Bruce F. Duba, and David B. MacQueen. Profiling in the presence of optimization and garbage collection. Technical Report CS-TR-197-88, Department of Computer Science, Princeton University, November 1988.

[appe88] Andrew W. Appel, John R. Ellis, and Kai Li. Real-time concurrent collection on stock multiprocessors. ACM SIGPLAN Notices, 23(7):11-20, 1988.

[appe88a] Andrew W. Appel and Aage Bendiksen. Vectorized garbage collection. Technical Report CS-TR-169-88, Department of Computer Science, Princeton University, July 1988.

[appe89c] Andrew W. Appel and Aage Bendiksen. Vectorized garbage collection. The Journal of Supercomputing, 3:151-160, 1989. Available here.

[appe93] Andrew W. Appel and Marcelo J. R. Gonçalves. Hash-consing garbage collection. Technical Report CS-TR-412-93, Department of Computer Science, Princeton University, February 1993. Available here.

[appe88d] Andrew W. Appel and David R. Hanson. Copying garbage collection in the presence of ambiguous references. Technical Report CS-TR-162-88, Department of Computer Science, Princeton University, 1988.

[appe91] Andrew W. Appel and Kai Li. Virtual memory primitives for user programs. In ASPLOS 1991 [ASPLOS91], 1991, pages 96-107. Available here.

[appe94] Andrew W. Appel and Zhong Shao. An empirical and analytic study of stack vs. heap cost for languages with closures. Technical Report CS-TR-450-94, Department of Computer Science, Princeton University, March 1994. Available here.

[appe96] Andrew W. Appel and Zhong Shao. Empirical and analytic study of stack versus heap cost for languages with closures. Journal of Functional Programming, 6(1):47-74, January 1996. Available here.

[appe87] Andrew W. Appel. Garbage collection can be faster than stack allocation. Information Processing Letters, 25(4):275-279, 1987. Available here.

[appe88b] Andrew W. Appel. Allocation without locking. Technical Report CS-TR-182-88, Department of Computer Science, Princeton University, September 1988.

[appe89a] Andrew W. Appel. Allocation without locking. Software Practice and Experience, 19(7), 1989. Short Communication.

[appe89b] Andrew W. Appel. Runtime tags aren't necessary. Lisp and Symbolic Computation, 2:153-162, 1989.

[appe89] Andrew W. Appel. Simple generational garbage collection and fast allocation. Software Practice and Experience, 19(2):171-183, 1989. Available here.

[appe90] Andrew W. Appel. A runtime system. Lisp and Symbolic Computation, 3:343-380, 1990.

[appe91a] Andrew W. Appel. Garbage collection. In Peter Lee, editor, Topics in Advanced Language Implementation, pages 89-100. MIT Press, 1991.

[appe92a] Andrew W. Appel. The runtime system, chapter 16, pages 205-214. Cambridge University Press, 1992.

[appe92] Andrew W. Appel. Tutorial: Compilers and runtime systems for languages with garbage collection. In PLDI 1992 [PLDI92], 1992.

[appe94a] Andrew W. Appel. Emulating write-allocate on a no-write-allocate cache. Technical Report TR-459-94, Department of Computer Science, Princeton University, June 1994. Available here.

[appe97c] Andrew W. Appel. A better analytical model for the strong generational hypothesis, November 1997. Cited by [stef99].

[appe97a] Andrew W. Appel. Modern Compiler Implementation in C: Basic Techniques. Cambridge University Press, 1997. Available here.

[appe97b] Andrew W. Appel. Modern Compiler Implementation in Java: Basic Techniques. Cambridge University Press, 1997. Available here.

[appe97] Andrew W. Appel. Modern Compiler Implementation in ML: Basic Techniques. Cambridge University Press, 1997. Available here.

[appe98a] Andrew W. Appel. Modern Compiler Implementation in C. Cambridge University Press, 1998.

[appe98b] Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.

[appe98] Andrew W. Appel. Modern Compiler Implementation in ML. Cambridge University Press, 1998.

[appl88] Karen Appleby, Mats Carlsson, Seif Haridi, and Dan Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):719-741, 1988.

[armb07] Austin Armbruster, Jason Baker, Antonio Cunei, Chapman Flack, David Holmes, Filip Pizlo, Edward Pla, Marek Prochazka, and Jan Vitek. A real-time Java virtual machine with applications in avionics. ACM Transactions on Embedded Computing Systems (TECS), 7(1), 2007. Supersedes [bake06]. Available here.

[arms93] Joe Armstrong, Robert Virding, and Mike Williams. Concurrent Programming in ERLANG. Prentice-Hall, 1993.

[arms95] Joe Armstrong and Robert Virding. One-pass real-time generational mark-sweep garbage collection. In Baker [IWMM95], 1995. Available here.

[arnb72] Stefan Arnborg. Storage administration in a virtual memory simulation system. BIT, 12(2):125-141, 1972.

[arnb74] Stefan Arnborg. Optimal memory management in a system with garbage collection. BIT, 14(4):375-381, 1974.

[ASPLOS82] Proceedings of the First International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGARCH Computer Architecture News 10(2), Palo Alto, CA, USA, March 1982.

[ASPLOS87] Proceedings of the Second International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGARCH Computer Architecture News 15(5), Palo Alto, CA, USA, October 1987.

[ASPLOS89] Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGARCH Computer Architecture News 17(2), Boston, MA, USA, April 1989.

[ASPLOS91] Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGARCH Computer Architecture News 19(2), Santa Clara, CA, USA, April 1991.

[ASPLOS92] Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 27(9), Boston, MA, USA, October 1992.

[ASPLOS94] Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 29(11), San Jose, CA, USA, October 1994.

[ASPLOS96] Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 31(9), Cambridge, MA, USA, October 1996.

[ASPLOS98] Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 33(11), San Jose, CA, USA, October 1998.

[ASPLOS00] Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 35(11), Cambridge, MA, USA, November 2000.

[ASPLOS02] Proceedings of the Tenth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 37(10), San Jose, CA, USA, October 2002.

[ASPLOS04] Shubu Mukherjee and Kathryn S. McKinley, editors. Proceedings of the Eleventh International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 39(11), Boston, MA, USA, October 2004.

[ASPLOS06] John Paul Shen and Margaret Martonosi, editors. Proceedings of the Twelfth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 41(11), San Jose, CA, USA, October 2006.

[ASPLOS08] Susan J. Eggers and James R. Larus, editors. Proceedings of the Thirteenth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 43(3), Seattle, WA, USA, March 2008.

[ASPLOS09] Mary Lou Soffa, editor. Proceedings of the Fourteenth International Conference on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 43(3), Seattle, WA, USA, March 2008.

[asse93] Holger Assenmacher, Thomas Breitbach, Peter Buhler, Volker Hübsch, and Reinhard Schwarz. PANDA - supporting distributed programming in C++. In Nierstras [ECOOP93], 1993, pages 361-383.

[atke04] Robert Atkey. A calculus for resource relationships. In SPACE 2004 [SPACE04], 2004. Available here.

[atki88] Martin C. Atkins and Lee R. Nackman. The active deallocation of objects in object-oriented systems. Software Practice and Experience, 18(11):1073-1089, 1988.

[atki89] Martin Atkins. Implementation Techniques for Object-Oriented Systems. PhD thesis, University of York, June 1989.

[atki83] Malcolm P. Atkinson, P.J. Bailey, K.J. Chisholm, W.P. Cockshott, and Ron Morrison. An approach to persistent programming. Computer Journal, 26(4):360-365, December 1983.

[atki89a] Russ Atkinson, Alan Demers, Carl Hauser, Christian Jacobi, Peter Kessler, and Mark Weiser. Experiences creating a portable Cedar. In PLDI 1989 [PLDI89], 1989, pages 322-329. Available here.

[atki85] Malcolm P. Atkinson and Ronald Morrison. Procedures as persistent data objects. ACM Transactions on Programming Languages and Systems, 7(4):539-559, October 1985.

[atta01] Clement R. Attanasio, David F. Bacon, Anthony Cocchi, and Stephen Smith. A comparative evaluation of parallel garbage collectors. In Fourteenth Annual Workshop on Languages and Compilers for Parallel Computing, volume 2624 of Lecture Notes in Computer Science, Cumberland Falls, KT, August 2001. Springer-Verlag. Available here.

[atta95] Giuseppe Attardi, Tito Flagella, and Pietro Iglio. Performance tuning in a customizable collector. In Baker [IWMM95], 1995.

[atta98] Giuseppe Attardi, Tito Flagella, and Pietro Iglio. A customisable memory management framework for C++. Software Practice and Experience, 28(11):1143-1183, November 1998. Available here.

[atta94a] Giuseppe Attardi and Tito Flagella. A customisable memory management framework. In ECOOP 1984 [ECOOP84], 1984, pages 320-343.

[atta94] Giuseppe Attardi and Tito Flagella. A customisable memory management framework. Technical Report TR-94-010, International Computer Science Institute, Berkeley, 1994. Also Proceedings of the USENIX C++ Conference, Cambridge, MA, 1994. Available here.

[atta96] Giuseppe Attardi and Tito Flagella. Memory management in the PoSSo solver. Journal of Symbolic Computation, 21(3):293-311, 1996.

[auer07b] Joshua Auerbach, David F. Bacon, Bob Blainey, Perry Cheng, Michael Dawson, Mike Fulton, David Grove, Darren Hart, and Mark Stoodley. Design and implementation of a comprehensive real-time Java virtual machine. In Proceedings of the 7th ACM & IEEE International Conference on Embedded Software, pages 249-258, Salzburg, Austria, 2007. Available here.

[auer07] Joshua Auerbach, David F. Bacon, F. Bömers, and Perry Cheng. Real-time music synthesis in Java using the Metronome garbage collector. In Proceedings of the International Computer Music Conference, Lecture Notes in Computer Science, Copenhagen, Denmark, 2007.

[auer07a] Joshua Auerbach, David F. Bacon, Daniel T. Iercan, Christopher M. Kirsch, V.T. Rajan, Harald Röck, , and Rainer Trummer. Java takes flight: Time-portable real-time programming with Exotasks. In Proceedings of ACM Conference on Languages, Compilers, and Tools for Embedded Systems, pages 31-62, 2007.

[auer08] Joshua Auerbach, David F. Bacon, Perry Cheng, David Grove, Ben Biron, Charlie Gracie, Bill McCloskey, Aleksandar Micic, and Ryan Sciampacone. Tax-and-spend: Democratic scheduling for real-time garbage collection. In Proceedings of the 7th ACM International Conference on Embedded software, pages 245-254, Atlanta, GA, 2008. Available here.

[auge79] Moshe J. Augenstein and Aaron M. Tenenbaum. Data Structures using Pascal. Prentice-Hall, Englewood Cliffs, N. J., second edition, 1986.

[augu87] Lex Augusteijn. Garbage collection in a distributed environment. In de Bakker et al. [PARLE87], 1987, pages 75-93.

[augu84] Lennart Augustsson. A compiler for lazy ML. In Steele [LFP84], 1984, pages 218-227.

[aust94] Todd M. Austin, Scott E. Breachand, and Gurindar S. Sohi. Efficient detection of all pointer and array access errors. In PLDI 1994 [PLDI94], 1994, pages 290-301. Available here.

[axfo90] Thomas H. Axford. Reference counting of cyclic graphs for functional programs. Computer Journal, 33(5):466-470, 1990.

[azag98] Alain Azagury, Elliot K. Kolodner, Erez Petrank, and Zvi Yehudai. Combining card marking with remembered sets: How to save scanning time. In Peyton~Jones and Jones [ISMM98], 1998, pages 10-19. Available here.

[azag99] Alain Azagury, Elliot K. Kolodner, and Erez Petrank. A note on the implementation of replication-based garbage collection for multithreaded applications and multiprocessor environments. Parallel Processing Letters, 1999. Available here.

[azat03] Hezi Azatchi, Yossi Levanoni, Harel Paz, and Erez Petrank. An on-the-fly mark and sweep garbage collector based on sliding view. In OOPSLA 2003 [OOPSLA03], 2003. Available here.

[azat03a] Hezi Azatchi and Erez Petrank. Integrating generations with advanced reference counting garbage collectors. In Proceedings of the 12th International Conference on Compiler Construction, CC 2003, volume 2622 of Lecture Notes in Computer Science, pages 185-199, Warsaw, Poland, May 2003. Springer.

[azat03b] Hezi Azatchi and Erez Petrank. Integrating generations with advanced reference counting garbage collectors. Concurrency and Computation: Practice and Experience, 18(9):959-995, 2006. Available here.

[azim07] Reza Azimi, Livio Soares, Michael Stumm, Thomas Walsh, and Angela Demke Brown. PATH: Page access tracking to improve memory management. In Morrisett and Sagiv [ISMM07], 2007, pages 31-42.

[azul08] Pauseless garbage collection. White paper AWP-005-020, Azul Systems Inc., July 2008. 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