{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:56:22Z","timestamp":1648594582407},"reference-count":41,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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":["Information and Software Technology"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0950-5849(00)00146-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:01:59Z","timestamp":1027616519000},"page":"151-155","source":"Crossref","is-referenced-by-count":1,"title":["Java garbage collection \u2014 a generic solution?"],"prefix":"10.1016","volume":"43","author":[{"given":"A","family":"Meehan","sequence":"first","affiliation":[]},{"given":"T","family":"Lunney","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0950-5849(00)00146-4_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/356850.356854","article-title":"Garbage collection of linked data structures","volume":"13","author":"Cohen","year":"1981","journal-title":"Computing Surveys"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB2","series-title":"Garbage Collection: Algorithms for Automatic Dynamic Memory Management","author":"Jones","year":"1996"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0017182","article-title":"Uniprocessor garbage collection techniques","volume":"637","author":"Wilson","year":"1992","journal-title":"Lecture Notes in Computer Science"},{"issue":"9","key":"10.1016\/S0950-5849(00)00146-4_BIB4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/185009.185040","article-title":"A bibliography on garbage collection and related topics","volume":"29","author":"Sankaran","year":"1994","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0017183","article-title":"Collection schemes for distributed garbage","volume":"637","author":"Abdullahi","year":"1995","journal-title":"Lecture notes in Computer Science"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-60368-9_26","article-title":"A survey of distributed garbage collection techniques","volume":"986","author":"Plainfosse","year":"1995","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-15975-4_26","article-title":"Miranda: a non-strict functional language with polymorphic types","volume":"201","author":"Turner","year":"1985","journal-title":"Lecture Notes in Computer Science"},{"issue":"9","key":"10.1016\/S0950-5849(00)00146-4_BIB8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/185009.185016","article-title":"Minimising reference count updating with deferred and anchored pointers for functional data structures","volume":"29","author":"Baker","year":"1994","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-60368-9_31","article-title":"One pass real time generational mark sweep garbage collection","volume":"986","author":"Armstrong","year":"1995","journal-title":"Lecture Notes in Computer Science"},{"issue":"9","key":"10.1016\/S0950-5849(00)00146-4_BIB10","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1002\/spe.4380180902","article-title":"Garbage collection in an uncooperative environment","volume":"19","author":"Boehm","year":"1988","journal-title":"Software Practice and Experience"},{"issue":"7","key":"10.1016\/S0950-5849(00)00146-4_BIB11","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/spe.4380190704","article-title":"Allocation without locking","volume":"19","author":"Appel","year":"1989","journal-title":"Software Practice and Experience"},{"issue":"12","key":"10.1016\/S0950-5849(00)00146-4_BIB12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/367487.367501","article-title":"A method of overlapping and erasure of lists","volume":"3","author":"Collins","year":"1960","journal-title":"Communications of the ACM"},{"issue":"9","key":"10.1016\/S0950-5849(00)00146-4_BIB13","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/367593.367617","article-title":"Symmetric list processor","volume":"6","author":"Weizenbaum","year":"1963","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/S0950-5849(00)00146-4_BIB14","first-page":"93","article-title":"Analysis \u2014 a compile time analysis to improve reference counting","volume":"1","author":"Majeed","year":"1993","journal-title":"Journal of Programming Languages"},{"issue":"7","key":"10.1016\/S0950-5849(00)00146-4_BIB15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/74818.74846","article-title":"Generational reference counting","volume":"24","author":"Goldberg","year":"1989","journal-title":"SIGPLAN Notices"},{"issue":"2","key":"10.1016\/S0950-5849(00)00146-4_BIB16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","article-title":"Implementing lazy functional languages on stock hardware","volume":"2","author":"Peyton Jones","year":"1992","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB17","unstructured":"P.H. Hartel, Performance Analysis of Storage Management in Combinator Graph Reduction, PhD thesis, University of Amsterdam, 1988."},{"issue":"9","key":"10.1016\/S0950-5849(00)00146-4_BIB18","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1145\/360336.360345","article-title":"An efficient, incremental, automatic garbage collector","volume":"19","author":"Deutsch","year":"1976","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB19","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/357062.357070","article-title":"Morris' garbage compaction algorithm restores reference counts","volume":"1","author":"Wise","year":"1979","journal-title":"Transactions of Programming Languages and Systems"},{"issue":"4","key":"10.1016\/S0950-5849(00)00146-4_BIB20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(95)00096-U","article-title":"Static analysis for optimizing reference counting","volume":"55","author":"Park","year":"1995","journal-title":"Information Processing Letters"},{"issue":"5","key":"10.1016\/S0950-5849(00)00146-4_BIB21","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/277652.277715","article-title":"An implementation of complete, asynchronous, distributed garbage collection","volume":"33","author":"LeFessant","year":"1998","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB22","doi-asserted-by":"crossref","unstructured":"U. Maheshwari, B. Liskov, Collecting cyclic distributed garbage by controlled migration. Distributed Computing, 10 (2) (1997) 79\u201386.","DOI":"10.1007\/s004460050026"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB23","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/BFb0017195","article-title":"A compile time memory reuse scheme for concurrent logic programs","volume":"637","author":"Duvvru","year":"1992","journal-title":"Lecture Notes in Computer Science"},{"issue":"9","key":"10.1016\/S0950-5849(00)00146-4_BIB24","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1145\/48529.48536","article-title":"Improving locality of reference in a garbage collecting memory management system","volume":"31","author":"Courts","year":"1998","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB25","unstructured":"J. Gosling, H. McGilton, The Java language environment, http:\/\/java.sun.com\/docs\/white\/langenv."},{"key":"10.1016\/S0950-5849(00)00146-4_BIB26","series-title":"The Java Programming Language","author":"Arnold","year":"1996"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB27","series-title":"Activejava","author":"Freeman","year":"1996"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB28","series-title":"Beginning Java","author":"Horton","year":"1997"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB29","series-title":"Java & Co","author":"Diehl","year":"1997"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB30","unstructured":"M. Campione, Walrath, The Java tutorial, 2nd ed., Object-Oriented Programming for the Internet, Java Series, 1998."},{"key":"10.1016\/S0950-5849(00)00146-4_BIB31","unstructured":"Venners, The impact of garbage collection on Java programs http:\/\/207.82.103.221\/us\/articles\/gcimpact.html."},{"key":"10.1016\/S0950-5849(00)00146-4_BIB32","unstructured":"D. Kramer, The Java language specification, types values and variables, http:\/\/java.sun.com\/docs\/books\/jls\/html\/4.doc.html."},{"key":"10.1016\/S0950-5849(00)00146-4_BIB33","series-title":"The Java Language Specification","author":"Gosling","year":"1996"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB34","series-title":"The Java Virtual Machine Specification","author":"Lindholm","year":"1996"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB35","unstructured":"http:\/\/java.sun.com\/docs\/white\/langenv\/Security.doc2.html."},{"issue":"4","key":"10.1016\/S0950-5849(00)00146-4_BIB36","first-page":"265","article-title":"A distributed object model for the Java system","volume":"9","author":"Wollrath","year":"1996","journal-title":"Computing Systems"},{"issue":"5","key":"10.1016\/S0950-5849(00)00146-4_BIB37","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/277652.277738","article-title":"Garbage collection and local variable type-precision and liveness in Java\u2122 Virtual Machines","volume":"33","author":"Agesen","year":"1998","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB38","unstructured":"C. McManus, Not using garbage collection, JavaWorld, Sept 1996"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB39","unstructured":"K. Nilsen, http:\/\/www.sys-com\/java\/issl\/real.htm."},{"key":"10.1016\/S0950-5849(00)00146-4_BIB40","unstructured":"D.J. Spitz, http:\/\/metadigest.xcf.berkeley.edu\/archive\/advanced-java\/"},{"key":"10.1016\/S0950-5849(00)00146-4_BIB41","unstructured":"A. Meehan, Garbage Collection and Data Abstraction Based Modular Programming, DPhil thesis, University of Ulster, 1999."}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584900001464?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584900001464?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T16:21:30Z","timestamp":1555777290000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584900001464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0950584900001464"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(00)00146-4","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}