{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:17:20Z","timestamp":1672258640374},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"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 Processing Letters"],"published-print":{"date-parts":[[1984,5]]},"DOI":"10.1016\/0020-0190(84)90108-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"179-187","source":"Crossref","is-referenced-by-count":3,"title":["Programmed deallocation without dangling reference"],"prefix":"10.1016","volume":"18","author":[{"given":"Gianna","family":"Cioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoni","family":"Kreczmar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90108-X_BIB1","series-title":"Reference Manual for the ADA Programming Language","year":"1980"},{"issue":"4","key":"10.1016\/0020-0190(84)90108-X_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BF00991820","article-title":"Time required for garbage collection in retention block-structures languages","volume":"7","author":"Berry","year":"1978","journal-title":"Internat. J. Comput. Inform. Sci."},{"issue":"3","key":"10.1016\/0020-0190(84)90108-X_BIB3","doi-asserted-by":"crossref","DOI":"10.1145\/356850.356854","article-title":"Garbage collection of linked data structures","volume":"13","author":"Cohen","year":"1981","journal-title":"ACM Comput. Surv."},{"issue":"10","key":"10.1016\/0020-0190(84)90108-X_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/362759.362813","article-title":"Concurrent control with \u2018readers\u2019 and \u2018writers\u2019","volume":"14","author":"Courtois","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(84)90108-X_BIB5","article-title":"On-the-fly garbage collection: An exercise in cooperation","volume":"46","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0020-0190(84)90108-X_BIB6","article-title":"Storing a sparse table with O(1) worst case access time","author":"Fredman","year":"1982","journal-title":"Proc. Foundations of Computer Science Conf."},{"issue":"N4","key":"10.1016\/0020-0190(84)90108-X_BIB7","article-title":"EDISON\u2014a multiprocessor language","volume":"11","author":"Brinch Hansen","year":"1982","journal-title":"Software Practice and Experience"},{"key":"10.1016\/0020-0190(84)90108-X_BIB8","article-title":"The Art of Computer Programming","volume":"Vol. I","author":"Knuth","year":"1973"},{"issue":"3","key":"10.1016\/0020-0190(84)90108-X_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/357139.357143","article-title":"Referencing and retention in block-structured coroutines","volume":"3","author":"Lindstrom","year":"1981","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0020-0190(84)90108-X_BIB10","article-title":"CLU Reference Manual","volume":"114","author":"Liskov","year":"1981"},{"key":"10.1016\/0020-0190(84)90108-X_BIB11","series-title":"LOGLAN 82: Programming Language","year":"1982"},{"key":"10.1016\/0020-0190(84)90108-X_BIB12","series-title":"Information Processing Language V Manual","author":"Newell","year":"1961"},{"issue":"9","key":"10.1016\/0020-0190(84)90108-X_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/361002.361005","article-title":"Multiprocessing compactifying garbage collection","volume":"18","author":"Steele","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(84)90108-X_BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/BF00264291","article-title":"The programming language PASCAL","author":"Wirth","year":"1971","journal-title":"Acta Informatica N1"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908490108X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908490108X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:57:51Z","timestamp":1555088271000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908490108X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,5]]}},"alternative-id":["002001908490108X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90108-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,5]]}}}