{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:01Z","timestamp":1772164081428,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,14]]},"DOI":"10.1145\/2926697.2926701","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T15:23:42Z","timestamp":1464881022000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Block-free concurrent GC: stack scanning and copying"],"prefix":"10.1145","author":[{"given":"Erik","family":"\u00d6sterlund","sequence":"first","affiliation":[{"name":"Linnaeus University, Sweden"}]},{"given":"Welf","family":"L\u00f6we","sequence":"additional","affiliation":[{"name":"Linnaeus University, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.53992"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359470"},{"key":"e_1_3_2_1_3_1","first-page":"22","volume-title":"Languages and Programming","unstructured":"doi : 10.1145\/359460.359470. URL http:\/\/doi.acm.org\/10.1145\/ 359460.359470. M. Ben-Ari. On-the-fly garbage collection: New algorithms inspired by program proofs. In Automata , Languages and Programming , pages 14\u2013 22 . Springer, 1982. 10.1145\/359460.359470 doi: 10.1145\/359460.359470. URL http:\/\/doi.acm.org\/10.1145\/ 359460.359470. M. Ben-Ari. On-the-fly garbage collection: New algorithms inspired by program proofs. In Automata, Languages and Programming, pages 14\u2013 22. Springer, 1982."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384016"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038037.1941585"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1446"}],"event":{"name":"ISMM '16: International Symposium on Memory Management","location":"Santa Barbara CA USA","acronym":"ISMM '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2926697.2926701","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2926697.2926701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:56:20Z","timestamp":1750208180000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2926697.2926701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":6,"alternative-id":["10.1145\/2926697.2926701","10.1145\/2926697"],"URL":"https:\/\/doi.org\/10.1145\/2926697.2926701","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3241624.2926701","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}