{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:19Z","timestamp":1772163979387,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,17]],"date-time":"2010-10-17T00:00:00Z","timestamp":1287273600000},"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":[[2010,10,17]]},"DOI":"10.1145\/1869459.1869482","type":"proceedings-article","created":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T08:41:35Z","timestamp":1287477695000},"page":"256-269","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["What can the GC compute efficiently?"],"prefix":"10.1145","author":[{"given":"Christoph","family":"Reichenbach","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Immerman","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Smaragdakis","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward E.","family":"Aftandilian","sequence":"additional","affiliation":[{"name":"Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel Z.","family":"Guyer","sequence":"additional","affiliation":[{"name":"Tufts University, Medford, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542503"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/353171.353175"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449776"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167504"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146238.1146266"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321643"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297027.1297056"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"}}N. Immerman. Descriptive Complexity. Springer 1998.   }}N. Immerman. Descriptive Complexity. Springer 1998.","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-0-387-21798-7_12","volume-title":"Programming methodology","author":"Jackson D.","year":"2003","unstructured":"}} D. Jackson . Object models as heap invariants. Programming methodology , pages 247 -- 268 , 2003 . }}D. Jackson. Object models as heap invariants. Programming methodology, pages 247--268, 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_47"},{"key":"e_1_3_2_1_13_1","volume-title":"Object-Oriented Software Construction","author":"Meyer B.","year":"1997","unstructured":"}} B. Meyer . Object-Oriented Software Construction . Prentice Hall PTR , 2 nd edition, 1997 . }}B. Meyer. Object-Oriented Software Construction. Prentice Hall PTR, 2nd edition, 1997.","edition":"2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508275"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/186025.186041"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321661"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028664.1028774"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292552"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250770"},{"key":"e_1_3_2_1_20_1","volume-title":"release 1.03 edition","author":"}}Standard Performance Evaluation Corporation","year":"1999","unstructured":"}}Standard Performance Evaluation Corporation . SPECjvm98 Documentation , release 1.03 edition , 1999 . }}Standard Performance Evaluation Corporation. SPECjvm98 Documentation, release 1.03 edition, 1999."},{"key":"e_1_3_2_1_21_1","volume-title":"release 1.01 edition","author":"}}Standard Performance Evaluation Corporation","year":"2001","unstructured":"}}Standard Performance Evaluation Corporation . SPECjbb200 0 Documentation , release 1.01 edition , 2001 . }}Standard Performance Evaluation Corporation. SPECjbb2000 Documentation, release 1.01 edition, 2001."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806651.1806658"},{"key":"e_1_3_2_1_23_1","first-page":"42","volume-title":"ACM International Workshop on Memory Management, number 637 in Lecture Notes in Computer Science","author":"Wilson P. R.","year":"1992","unstructured":"}} P. R. Wilson . Uniprocessor Garbage Collection Techniques. In Y. Bekkers and J. Cohen, editors, ACM International Workshop on Memory Management, number 637 in Lecture Notes in Computer Science , pages 1\u00ad 42 , St. Malo, France, Sept. 1992 . Springer-Verlag . }}P. R. Wilson. Uniprocessor Garbage Collection Techniques. In Y. Bekkers and J. Cohen, editors, ACM International Workshop on Memory Management, number 637 in Lecture Notes in Computer Science, pages 1\u00ad42, St. Malo, France, Sept. 1992. Springer-Verlag."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375624"}],"event":{"name":"SPLASH '10: Systems Programming Languages and Applications: Software for Humanity","location":"Reno\/Tahoe Nevada USA","acronym":"SPLASH '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1869459.1869482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1869459.1869482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:08:14Z","timestamp":1750234094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1869459.1869482"}},"subtitle":["a language for heap assertions at GC time"],"short-title":[],"issued":{"date-parts":[[2010,10,17]]},"references-count":24,"alternative-id":["10.1145\/1869459.1869482","10.1145\/1869459"],"URL":"https:\/\/doi.org\/10.1145\/1869459.1869482","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1932682.1869482","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,10,17]]},"assertion":[{"value":"2010-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}