{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:43:19Z","timestamp":1742391799346},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055940X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017203","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:37:21Z","timestamp":1132627041000},"page":"388-403","source":"Crossref","is-referenced-by-count":27,"title":["Incremental collection of mature objects"],"prefix":"10.1007","author":[{"given":"Richard L.","family":"Hudson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Eliot B.","family":"Moss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/960116.53992","volume":"7","author":"A. W. Appel","year":"1988","unstructured":"Andrew W. Appel, John R. Ellis, and Kai Li Realtime concurrent collection on stock multiprocessors. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation (Atlanta, Georgia, June 1988), ACM SIGPLAN Not. 23,7 (July 1988), pp. 11\u201320.","journal-title":"ACM SIGPLAN Not. 23"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/359460.359470","volume":"21","author":"H. G. Baker","year":"1978","unstructured":"H. G. Baker. List processing in real time on a serial computer. Communications of the ACM 21,4 (April 1978), 280\u2013294.","journal-title":"Communications of the ACM"},{"key":"22_CR3","volume-title":"PhD thesis","author":"P. B. Bishop","year":"1977","unstructured":"Peter B. Bishop. Computer Systems with a Very Large Address Space and Garbage Collection. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, May 1977."},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/113446.113459","volume":"11","author":"H. Boehm","year":"1991","unstructured":"Hans-J. Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. In [OOPSLA, 1991], pp. 157\u2013164.","journal-title":"ACM SIGPLAN Not. 26"},{"issue":"11","key":"22_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1145\/362790.362798","volume":"13","author":"C. J. Cheney","year":"1970","unstructured":"C. J. Cheney. A nonrecursive list compacting algorithm. Communications of the ACM 13,11 (November 1970), 677\u2013678.","journal-title":"Communications of the ACM"},{"key":"22_CR6","first-page":"273","volume-title":"Conference on Programming Language Design and Implementation","author":"A. Diwan","year":"1992","unstructured":"Amer Diwan, J. Eliot B. Moss, and Richard L. Hudson. Compiler support for garbage collection in a statically typed language. In Conference on Programming Language Design and Implementation (San Francisco, California, June 1992), SIGPLAN, ACM Press, pp. 273\u2013282."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1145\/363269.363280","volume":"11","author":"R. R. Fenichel","year":"1969","unstructured":"Robert R. Fenichel and Jerome C. Yochelson. A LISP garbage-collector for virtual-memory computer systems. Communications of the ACM 12,11 (November 1969), 611\u2013612.","journal-title":"Communications of the ACM 12"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/118014.117957","volume":"11","author":"B. Hayes","year":"1991","unstructured":"Barry Hayes. Using key object opportunism to collect old objects. In [OOPSLA, 1991], pp. 33\u201346.","journal-title":"ACM SIGPLAN Not. 26"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Antony L. Hosking, J. Eliot B. Moss, and Darko Stefanovi\u0107. A comparative performance evaluation of write barrier implementations. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (Vancouver, Canada, October 1992). To appear.","DOI":"10.1145\/141936.141946"},{"key":"22_CR10","volume-title":"Weight A language-independent garbage collector toolkit COINS Technical Report 91\u201347","author":"R. L. Hudson","year":"1991","unstructured":"Richard L. Hudson, J. Eliot B. Moss, Amer Diwan, and Christopher F. Weight A language-independent garbage collector toolkit COINS Technical Report 91\u201347, University of Massachusetts, Amherst September 1991. Submitted for publication."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/5684.5686","volume":"4","author":"D. W. Jones","year":"1986","unstructured":"Douglas W. Jones. An empirical comparison of priority-queue and event-set implementations. Communications of the ACM 29, 4 (April 1986), 300\u2013311.","journal-title":"Communications of the ACM 29"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Bernard Lang and Francis Dupont Incremental incrementally compacting garbage collection. SIGPLAN '87-Symposium on Interpreters and Interpretive Techniques (1987), 253\u2013263.","DOI":"10.1145\/29650.29677"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/358141.358147","volume":"6","author":"H. Lieberman","year":"1983","unstructured":"Henry Lieberman and Carl Hewitt. A real-time garbage collection based on the lifetimes of objects. Communications of the ACM 26, 6 (June 1983), 419\u2013429.","journal-title":"Communications of the ACM 26"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"David Moon. Garbage collection in a large Lisp system. In Proceedings of the ACM Symposium on Lisp and Functional Programming (Austin, TX, August 1984), pp. 235\u2013246.","DOI":"10.1145\/800055.802040"},{"key":"22_CR15","unstructured":"Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (Phoenix, Arizona, October 1991), ACM SIGPLAN Not. 26,11 (November 1991)."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. In Proceedings of the ACM SIGACT Symposium on Theory (Boston, Massachusetts, April 1983), pp. 235\u2013245.","DOI":"10.1145\/800061.808752"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search frees. Journal of the ACM 32,3 (July 1985).","DOI":"10.1145\/3828.3835"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"David Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In Proceedings of the ACM SIGSOFT\/SIGPLAN Software Engineering Symposium on Practical Software Development Environments (Pittsburgh, Pennsylvania, April 1984), ACM SIGPLAN Not. 19,5 (May 1984), pp. 157\u2013167.","DOI":"10.1145\/800020.808261"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"David Ungar and Frank Jackson. Tenuring policies for generation-based storage reclamation. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (San Diego, California, September 1988), ACM SIGPLAN Not. 23, 11 (November 1988), pp. 1\u201317.","DOI":"10.1145\/62083.62085"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Daniel Weinreb and David Moon. Lisp Machine Manual, third ed. Massachusetts Institute of Technology, 1981.","DOI":"10.1145\/1056737.1056738"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Jon L. White. Address\/memory management for a gigantic Lisp environment or, GC considered harmful. In Proceedings of the ACM Symposium on Lisp and Functional Programming (Stanford, California, August 1980), ACM, pp. 119\u2013127.","DOI":"10.1145\/800087.802797"},{"key":"22_CR22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/113446.113461","volume":"6","author":"P. R. Wilson","year":"1991","unstructured":"Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Effective \u201cstatic-graph\u201d reorganization to improve locality in garbage-collected systems. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation (Toronto, Canada, June 1991), ACM SIGPLAN Not. 26, 6 (June 1991), pp. 177\u2013191.","journal-title":"ACM SIGPLAN Not. 26"},{"key":"22_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/74878.74882","volume":"10","author":"P. R. Wilson","year":"1989","unstructured":"Paul R. Wilson and Thomas G. Moher. Design of the Opportunistic Garbage Collector. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (New Orleans, Louisiana, October 1989), ACM SIGPLAN Not. 24, 10 (October 1989), pp. 23\u201335.","journal-title":"ACM SIGPLAN Not. 24"}],"container-title":["Lecture Notes in Computer Science","Memory Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017203.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:37:53Z","timestamp":1607531873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055940X"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0017203","relation":{},"subject":[]}}