{"id":"https://openalex.org/W2134926801","doi":"https://doi.org/10.1145/1296907.1296924","title":"A correct and useful incremental copying garbage collector","display_name":"A correct and useful incremental copying garbage collector","publication_year":2007,"publication_date":"2007-10-21","ids":{"openalex":"https://openalex.org/W2134926801","doi":"https://doi.org/10.1145/1296907.1296924","mag":"2134926801"},"language":"en","primary_location":{"id":"doi:10.1145/1296907.1296924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th international symposium on Memory management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-39218","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021679960","display_name":"Martin Kero","orcid":null},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Martin Kero","raw_affiliation_strings":["Lule\u00e5 University of Technology, Lule\u00e5, Sweden","[Lulea University of Technology, Lulea, Sweden]"],"affiliations":[{"raw_affiliation_string":"Lule\u00e5 University of Technology, Lule\u00e5, Sweden","institution_ids":["https://openalex.org/I190632392"]},{"raw_affiliation_string":"[Lulea University of Technology, Lulea, Sweden]","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112008233","display_name":"Johan Nordlander","orcid":null},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan Nordlander","raw_affiliation_strings":["Lule\u00e5 University of Technology, Lule\u00e5, Sweden","[Lulea University of Technology, Lulea, Sweden]"],"affiliations":[{"raw_affiliation_string":"Lule\u00e5 University of Technology, Lule\u00e5, Sweden","institution_ids":["https://openalex.org/I190632392"]},{"raw_affiliation_string":"[Lulea University of Technology, Lulea, Sweden]","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009216509","display_name":"Per Lindgren","orcid":"https://orcid.org/0000-0001-6440-8900"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Per Lindgren","raw_affiliation_strings":["Lule\u00e5 University of Technology, Lule\u00e5, Sweden","[Lulea University of Technology, Lulea, Sweden]"],"affiliations":[{"raw_affiliation_string":"Lule\u00e5 University of Technology, Lule\u00e5, Sweden","institution_ids":["https://openalex.org/I190632392"]},{"raw_affiliation_string":"[Lulea University of Technology, Lulea, Sweden]","institution_ids":["https://openalex.org/I190632392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021679960"],"corresponding_institution_ids":["https://openalex.org/I190632392"],"apc_list":null,"apc_paid":null,"fwci":3.8637,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.93702913,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.9487018585205078},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.8862649202346802},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.8566242456436157},{"id":"https://openalex.org/keywords/manual-memory-management","display_name":"Manual memory management","score":0.8076372146606445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.763709306716919},{"id":"https://openalex.org/keywords/copying","display_name":"Copying","score":0.7498022317886353},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.6617087721824646},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4721873998641968},{"id":"https://openalex.org/keywords/memory-leak","display_name":"Memory leak","score":0.4678184688091278},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4549103379249573},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4513097405433655},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44927772879600525},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41633492708206177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3458816409111023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3453887701034546}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9487018585205078},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.8862649202346802},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.8566242456436157},{"id":"https://openalex.org/C82810778","wikidata":"https://www.wikidata.org/wiki/Q6752316","display_name":"Manual memory management","level":4,"score":0.8076372146606445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.763709306716919},{"id":"https://openalex.org/C2779151265","wikidata":"https://www.wikidata.org/wiki/Q1156791","display_name":"Copying","level":2,"score":0.7498022317886353},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.6617087721824646},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4721873998641968},{"id":"https://openalex.org/C156731835","wikidata":"https://www.wikidata.org/wiki/Q751740","display_name":"Memory leak","level":4,"score":0.4678184688091278},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4549103379249573},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4513097405433655},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44927772879600525},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41633492708206177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3458816409111023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3453887701034546},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1296907.1296924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th international symposium on Memory management","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1015.2520","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1015.2520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://pure.ltu.se/portal/files/901432/ismm03e-kero.pdf","raw_type":"text"},{"id":"pmh:oai:DiVA.org:ltu-39218","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-39218","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:ltu-39218","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-39218","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1550132154","https://openalex.org/W1603799276","https://openalex.org/W1864548572","https://openalex.org/W1965760540","https://openalex.org/W1966891975","https://openalex.org/W1975076763","https://openalex.org/W1987079491","https://openalex.org/W2029849818","https://openalex.org/W2073569229","https://openalex.org/W2079813853","https://openalex.org/W2087875803","https://openalex.org/W2092767796","https://openalex.org/W2112630372","https://openalex.org/W2156956446","https://openalex.org/W2158525816","https://openalex.org/W2161531345","https://openalex.org/W4290864872"],"related_works":["https://openalex.org/W3022395790","https://openalex.org/W2142383914","https://openalex.org/W2005118838","https://openalex.org/W3005855803","https://openalex.org/W1513015403","https://openalex.org/W2013466772","https://openalex.org/W43532704","https://openalex.org/W2042469414","https://openalex.org/W3032380018","https://openalex.org/W1487406077"],"abstract_inverted_index":{"Designing":[0],"a":[1,8,24,52,63,71,87,92,113,147],"garbage":[2,78,105],"collector":[3,126],"with":[4,42,46,116],"real-time":[5],"properties":[6],"is":[7,60,84,99,109,127],"particularlydifficult":[9],"task,":[10],"involving":[11],"the":[12,56,97,104,133,139],"construction":[13],"of":[14,49,55,61,74,91,96,142,150],"both":[15,128],"an":[16,75],"incremental":[17,76],"run-timealgorithm":[18],"as":[19,21,86],"well":[20],"methods":[22],"enabling":[23],"priori":[25],"reasoning":[26],"about":[27],"schedulability":[28],"in":[29,36,132,146],"two":[30],"dimensions":[31],"(time":[32],"and":[33,130],"memory":[34],"usage":[35],"conjunction).":[37],"In":[38,66,120],"order":[39],"to":[40,112],"comply":[41],"such":[43],"ambitious":[44],"goals":[45],"any":[47,143],"amount":[48],"formal":[50,72],"rigor,":[51],"comprehensive":[53],"understanding":[54],"actual":[57],"algorithm":[58,98],"used":[59],"course":[62],"fundamental":[64],"requirement.":[65],"this":[67],"paper":[68],"we":[69,122],"present":[70],"model":[73],"copying":[77],"collector,":[79],"where":[80],"each":[81],"atomic":[82],"increment":[83],"modeled":[85],"transition":[88],"between":[89],"states":[90],"heap":[93,107,115,145],"process.":[94],"Soundness":[95],"shown":[100],"by":[101],"proving":[102],"that":[103,124,135],"collecting":[106],"process":[108],"weakly":[110],"bisimilar":[111],"non-collecting":[114],"infinite":[117],"storage":[118],"space.":[119],"addition,":[121],"show":[123],"our":[125],"terminating":[129],"useful,":[131],"sense":[134],"it":[136],"actually":[137],"recovers":[138],"unreachable":[140],"parts":[141],"given":[144],"finite":[148],"number":[149],"steps.":[151]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}