{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:42:55Z","timestamp":1648762975536},"reference-count":43,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0140-3664(00)00172-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:32:26Z","timestamp":1027614746000},"page":"887-900","source":"Crossref","is-referenced-by-count":5,"title":["Autonomous garbage collection: resolving memory leaks in long-running server applications"],"prefix":"10.1016","volume":"23","author":[{"given":"B.","family":"Willard","sequence":"first","affiliation":[]},{"given":"O.","family":"Frieder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(00)00172-9_BIB1","unstructured":"S. Abraham, J. Patel, Parallel garbage collection on a virtual memory system, Proceedings of the International Conference on Parallel Processing and Applications, L'Aquila, Italy, September 1987. p. 243\u2013246. Also Technical Report CSRD 620, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign."},{"key":"10.1016\/S0140-3664(00)00172-9_BIB2","doi-asserted-by":"crossref","unstructured":"S. Aditya, C. Flood, J. Hicks, Garbage collection for strongly-typed languages using runtime type reconstruction, PLDI, p. 12\u201323, 1994. Also in Lisp Pointers VIII 3, July\u2013September 1994.","DOI":"10.1145\/182590.182414"},{"issue":"4","key":"10.1016\/S0140-3664(00)00172-9_BIB3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(87)90175-X","article-title":"Garbage collection can be faster than stack allocation","volume":"25","author":"Appel","year":"1987","journal-title":"Information Processing Letters"},{"issue":"7","key":"10.1016\/S0140-3664(00)00172-9_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/960116.53992","article-title":"Real-time concurrent collection on stock multiprocessors","volume":"23","author":"Appel","year":"1988","journal-title":"ACM SIGPLAN Notices"},{"issue":"2","key":"10.1016\/S0140-3664(00)00172-9_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/spe.4380190206","article-title":"Simple generational garbage collection and fast allocation","volume":"19","author":"Appel","year":"1989","journal-title":"Software Practice and Experience"},{"issue":"4","key":"10.1016\/S0140-3664(00)00172-9_BIB6","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/359460.359470","article-title":"List processing in real-time on a serial computer","volume":"21","author":"Baker","year":"1978","journal-title":"Communications of the ACM"},{"issue":"3","key":"10.1016\/S0140-3664(00)00172-9_BIB7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/130854.130862","article-title":"The Treadmill, real-time garbage collection without motion sickness","volume":"27","author":"Baker","year":"1992","journal-title":"ACM SIGPLAN Notices"},{"issue":"9","key":"10.1016\/S0140-3664(00)00172-9_BIB8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/185009.185016","article-title":"Minimizing reference count updating with deferred and anchored pointers for functional data structures","volume":"29","author":"Baker","year":"1994","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB9","doi-asserted-by":"crossref","unstructured":"J.F. Bartlett, Compacting garbage collection with ambiguous roots, Technical Report 88\/2, DEC Western Research Laboratory, Palo Alto, CA, February 1988. Also in Lisp Pointers, 1(6) (1988) 2\u201312.","DOI":"10.1145\/1317224.1317225"},{"issue":"9","key":"10.1016\/S0140-3664(00)00172-9_BIB10","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1002\/spe.4380180902","article-title":"Garbage collection in an uncooperative environment","volume":"18","author":"Boehm","year":"1988","journal-title":"Software Practice and Experience"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB11","doi-asserted-by":"crossref","unstructured":"H.-J. Boehm, Hardware and operating system support for conservative garbage collection, Proceedings of the IEEE International Workshop on Memory Management, Palo Alto, California, October 1991, p. 61\u201367.","DOI":"10.1109\/IWOOOS.1991.183023"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB12","doi-asserted-by":"crossref","unstructured":"H.-J. Boehm, Space efficient conservative garbage collection, Proceedings of the ACM SIGPLAN \u201991 Conference on Programming Language Design and Implementation, SIGPLAN Notices, 28, vol. 6, June 1993. p. 197\u2013206.","DOI":"10.1145\/155090.155109"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB13","unstructured":"J. Morris Chang, W. Srisa-an, C. Dan Lo, DMMX (Dynamic memory management extensions): an introduction, Workshop notes of ICCD Workshop on Hardware Support for Objects and Microarchitectures for Java, Austin, TX, 10 October 1999, p. 11\u201314."},{"issue":"11","key":"10.1016\/S0140-3664(00)00172-9_BIB14","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1145\/362790.362798","article-title":"Non-recursive list compacting algorithm","volume":"13","author":"Cheney","year":"1970","journal-title":"Communications of the ACM"},{"issue":"4","key":"10.1016\/S0140-3664(00)00172-9_BIB15","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/69575.357226","article-title":"Comparison of compacting algorithms for garbage collection","volume":"5","author":"Cohen","year":"1983","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"12","key":"10.1016\/S0140-3664(00)00172-9_BIB16","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1145\/367487.367501","article-title":"method for overlapping and erasure of lists","volume":"3","author":"Collins","year":"1960","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB17","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"issue":"11","key":"10.1016\/S0140-3664(00)00172-9_BIB18","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/359642.359655","article-title":"On-the-fly garbage collection: an exercise in cooperation","volume":"21","author":"Dijkstra","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB19","unstructured":"ISE Eiffel Garbage Collection mechanism, ISE Technical Report TR-EI-56\/GC, version 3.3.9, February 1996. http:\/\/www.eiffel.com\/doc\/manuals\/technology\/gc\/."},{"key":"10.1016\/S0140-3664(00)00172-9_BIB20","unstructured":"J.R. Ellis, D.L. Detlefs, Safe, efficient garbage collection for C++, Technical Report, Xerox PARC, Palo Alto, CA, 1993."},{"issue":"11","key":"10.1016\/S0140-3664(00)00172-9_BIB21","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1145\/363269.363280","article-title":"Lisp garbage collector for virtual memory computer systems","volume":"12","author":"Fenichel","year":"1969","journal-title":"Communications of the ACM"},{"issue":"1","key":"10.1016\/S0140-3664(00)00172-9_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/spe.4380170102","article-title":"Lazy garbage collection","volume":"17","author":"Glaser","year":"1987","journal-title":"Software Practice and Experience"},{"issue":"6","key":"10.1016\/S0140-3664(00)00172-9_BIB23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/113446.113460","article-title":"Tag-free garbage collection for strongly typed programming languages","volume":"26","author":"Goldberg","year":"1991","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB24","unstructured":"A. Goto, Y. Kimura, T. Nakagawa, T. Chikayama, Lazy reference counting: An incremental garbage collection method for parallel inference machines, Proceedings of ICLP, 1998. p. 1241\u20131256."},{"key":"10.1016\/S0140-3664(00)00172-9_BIB25","doi-asserted-by":"crossref","unstructured":"B. Hayes, Using key object opportunism to collect old objects, Proceedings of OOPSLA, 1991. p. 33\u201346.","DOI":"10.1145\/117954.117957"},{"issue":"4","key":"10.1016\/S0140-3664(00)00172-9_BIB26","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/0206047","article-title":"Minimizing garbage collection as a function of region size","volume":"6","author":"Larson","year":"1977","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"10.1016\/S0140-3664(00)00172-9_BIB27","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/358141.358147","article-title":"real-time garbage collector based on the lifetimes of objects","volume":"26","author":"Lieberman","year":"1983","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB28","doi-asserted-by":"crossref","unstructured":"M. Maeda, H. Konaka, Y. Ishikawa, T. Tomokiyo, A. Hori, J. Nolte, On-the-fly global garbage collection based on partly mark\u2013sweep, Proceedings of IWMM, 1995.","DOI":"10.1007\/3-540-60368-9_29"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB29","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine","volume":"3","author":"McCarthy","year":"1960","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB30","doi-asserted-by":"crossref","unstructured":"J.G. Morrisett, M. Felleisen, R. Harper, Abstract models of memory management, Technical Report CMU-CS-95-110, Carnegie Mellon University, January 1995.","DOI":"10.1145\/224164.224182"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB31","doi-asserted-by":"crossref","unstructured":"K.D. Nilsen, W.J. Schmidt, Hardware-assisted general-purpose garbage collection for hard real-time systems, Technical Report ISU TR92-17, Department of Computer Science, Iowa State University, October 1992.","DOI":"10.1145\/161494.161508"},{"issue":"1","key":"10.1016\/S0140-3664(00)00172-9_BIB32","first-page":"1","article-title":"A high-performance hardware-assisted real time garbage collection system","volume":"2","author":"Nilsen","year":"1994","journal-title":"Journal of Programming Languages"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB33","unstructured":"R.A. Shaw, Empirical analysis of a Lisp system, PhD thesis, Stanford University, 1988. Technical Report CSL-TR-88-351."},{"key":"10.1016\/S0140-3664(00)00172-9_BIB34","doi-asserted-by":"crossref","unstructured":"W.R. Stoye, T.J.W. Clarke, A.C. Norman, Some practical methods for rapid combinator reduction, Proceedings of ACM Symposium on LISP and Functional Programming, 1984. p. 159\u2013166.","DOI":"10.1145\/800055.802032"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB35","doi-asserted-by":"crossref","unstructured":"A. Tolmach, Tag-free garbage collection using explicit type parameters, Proceedings in PLDI, pp. 1\u201311. Also Lisp Pointers VIII 3, July\u2013September 1994.","DOI":"10.1145\/182590.182411"},{"issue":"5","key":"10.1016\/S0140-3664(00)00172-9_BIB36","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/390011.808261","article-title":"Generation scavenging: A non-disruptive high performance storage reclamation algorithm","volume":"19","author":"Ungar","year":"1984","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"10.1016\/S0140-3664(00)00172-9_BIB37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/111186.116734","article-title":"An adaptive tenuring policy for generation scavengers","volume":"14","author":"Ungar","year":"1992","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB38","unstructured":"B. Venners, Under The Hood: Java's garbage-collected heap, JavaWorld, August 1996. URL: http:\/\/www.javaworld.com\/javaworld\/jw081996\/jw08gc.html."},{"key":"10.1016\/S0140-3664(00)00172-9_BIB39","unstructured":"T. Wang, The MM garbage collector for C++, Master's thesis, California State Polytechnic University, October 1989."},{"key":"10.1016\/S0140-3664(00)00172-9_BIB40","unstructured":"P.R. Wilson, M.S. Johnstone, Truly real-time non-copying garbage collection, Proceedings of OOPSLA, 1993."},{"key":"10.1016\/S0140-3664(00)00172-9_BIB41","unstructured":"P.R. Wilson, Uniprocessor garbage collection techniques, Technical Report, University of Texas, January 1994."},{"issue":"3","key":"10.1016\/S0140-3664(00)00172-9_BIB42","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0164-1212(90)90084-Y","article-title":"Real-time garbage collection on general-purpose machines","volume":"11","author":"Yuasa","year":"1990","journal-title":"Journal of Software and Systems"},{"key":"10.1016\/S0140-3664(00)00172-9_BIB43","doi-asserted-by":"crossref","unstructured":"B. Zorn, Comparing mark-and-sweep and stop-and-copy garbage collection. In Conference Record of the 1990 ACM Symposium on Lisp and Functional Programming, Nice, France, June 1990, ACM Press.","DOI":"10.1145\/91556.91597"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366400001729?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366400001729?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T05:53:09Z","timestamp":1555825989000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366400001729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":43,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0140366400001729"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(00)00172-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}