{"id":"https://openalex.org/W4409310650","doi":"https://doi.org/10.1145/3720430","title":"Pathological Cases for a Class of Reachability-Based Garbage Collectors","display_name":"Pathological Cases for a Class of Reachability-Based Garbage Collectors","publication_year":2025,"publication_date":"2025-04-09","ids":{"openalex":"https://openalex.org/W4409310650","doi":"https://doi.org/10.1145/3720430"},"language":"en","primary_location":{"id":"doi:10.1145/3720430","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3720430","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3720430","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3720430","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079165150","display_name":"Matthew Sotoudeh","orcid":"https://orcid.org/0000-0003-2060-1009"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew Sotoudeh","raw_affiliation_strings":["Stanford University, Stanford, USA"],"raw_orcid":"https://orcid.org/0000-0003-2060-1009","affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079165150"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":3.0881,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.89941496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"9","issue":"OOPSLA1","first_page":"449","last_page":"476"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11464","display_name":"Homelessness and Social Issues","score":0.8174999952316284,"subfield":{"id":"https://openalex.org/subfields/3600","display_name":"General Health Professions"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T11464","display_name":"Homelessness and Social Issues","score":0.8174999952316284,"subfield":{"id":"https://openalex.org/subfields/3600","display_name":"General Health Professions"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8527398109436035},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6613521575927734},{"id":"https://openalex.org/keywords/pathological","display_name":"Pathological","score":0.6382991075515747},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.6327414512634277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4439558982849121},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.4302801489830017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35135433077812195},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.28533247113227844},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28336405754089355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2348977029323578},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22284182906150818},{"id":"https://openalex.org/keywords/pathology","display_name":"Pathology","score":0.1305309236049652}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8527398109436035},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6613521575927734},{"id":"https://openalex.org/C207886595","wikidata":"https://www.wikidata.org/wiki/Q1456138","display_name":"Pathological","level":2,"score":0.6382991075515747},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.6327414512634277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4439558982849121},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.4302801489830017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35135433077812195},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.28533247113227844},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28336405754089355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2348977029323578},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22284182906150818},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.1305309236049652}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3720430","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3720430","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3720430","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3720430","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3720430","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3720430","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2911450482","display_name":null,"funder_award_id":"DGE-165651 8","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5267932457","display_name":"Graduate Research Fellowship Program (GRFP)","funder_award_id":"1656518","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409310650.pdf","grobid_xml":"https://content.openalex.org/works/W4409310650.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1543830735","https://openalex.org/W1569153617","https://openalex.org/W1596586791","https://openalex.org/W1965601529","https://openalex.org/W2009049834","https://openalex.org/W2019026066","https://openalex.org/W2027137911","https://openalex.org/W2028080565","https://openalex.org/W2028431783","https://openalex.org/W2031707629","https://openalex.org/W2033068324","https://openalex.org/W2045255985","https://openalex.org/W2045430818","https://openalex.org/W2049820860","https://openalex.org/W2064312943","https://openalex.org/W2067169404","https://openalex.org/W2074456731","https://openalex.org/W2078022909","https://openalex.org/W2080023749","https://openalex.org/W2094631165","https://openalex.org/W2118143490","https://openalex.org/W2141577348","https://openalex.org/W2146875617","https://openalex.org/W2148746214","https://openalex.org/W2153217785","https://openalex.org/W2153715991","https://openalex.org/W2161531345","https://openalex.org/W2161719857","https://openalex.org/W2162883775","https://openalex.org/W2810725260","https://openalex.org/W3032912255","https://openalex.org/W3033163100","https://openalex.org/W4238411931","https://openalex.org/W4283700755","https://openalex.org/W4283706881","https://openalex.org/W4284688167","https://openalex.org/W4312735767","https://openalex.org/W4387773681","https://openalex.org/W4390098075","https://openalex.org/W6968026842"],"related_works":["https://openalex.org/W2132258996","https://openalex.org/W2245694847","https://openalex.org/W4381304378","https://openalex.org/W2188602196","https://openalex.org/W3174776489","https://openalex.org/W1700460898","https://openalex.org/W4387773637","https://openalex.org/W2808342711","https://openalex.org/W2034669405","https://openalex.org/W2785868435"],"abstract_inverted_index":{"Although":[0],"existing":[1],"garbage":[2,219,238,290],"collectors":[3],"(GCs)":[4],"perform":[5],"extremely":[6],"well":[7],"on":[8,218,298],"typical":[9,314],"programs,":[10],"there":[11,29,153],"still":[12],"exist":[13,30],"pathological":[14,68,132,164],"programs":[15,181],"for":[16,313],"which":[17],"modern":[18],"GCs":[19],"significantly":[20],"degrade":[21],"performance.":[22],"This":[23,105],"observation":[24],"begs":[25],"the":[26,73,82,87,189,225,235,249,268,282],"question:":[27],"might":[28],"a":[31,60,101,112,126,140,185,199,289],"\u2018holy":[32],"grail\u2019":[33],"GC":[34,61,88,121,142,247],"algorithm,":[35],"as":[36],"yet":[37],"undiscovered,":[38],"guaranteeing":[39],"both":[40],"constant-length":[41],"pause":[42,143],"times":[43],"and":[44,79,166,182,248,260],"that":[45,58,108,119,123,134,170,202,295],"memory":[46,83],"is":[47,62,70,154],"collected":[48],"promptly":[49],"upon":[50],"becoming":[51],"unreachable?":[52],"For":[53],"decades,":[54],"researchers":[55],"have":[56,215],"understood":[57],"such":[59],"not":[63,210],"always":[64],"possible,":[65],"i.e.,":[66],"some":[67,131],"behavior":[69],"unavoidable":[71],"when":[72],"program":[74,133,145],"can":[75,124],"make":[76],"heap":[77],"cycles":[78,204],"operates":[80],"near":[81],"limit,":[84],"regardless":[85],"of":[86,188,237],"algorithm":[89,122],"used.":[90],"However,":[91],"this":[92,212],"understanding":[93,110],"has":[94,130],"until":[95],"now":[96],"been":[97],"only":[98],"informal,":[99],"lacking":[100],"rigorous":[102,113,228,244],"formal":[103],"proof.":[104],"paper":[106,213],"complements":[107],"informal":[109],"with":[111,116],"proof,":[114],"showing":[115],"mathematical":[117],"certainty":[118],"every":[120],"implement":[125],"realistic":[127],"mutator-observer":[128],"interface":[129,195],"forces":[135],"it":[136,223],"to":[137,184,214,230,267,278,287,311],"either":[138,161,264],"introduce":[139],"long":[141],"into":[144],"execution":[146],"or":[147,179,205],"reject":[148],"an":[149],"allocation":[150],"even":[151],"though":[152],"available":[155],"space.":[156],"Hence,":[157],"language":[158],"designers":[159],"must":[160],"accept":[162],"these":[163,231],"scenarios":[165],"design":[167],"heuristic":[168],"approaches":[169],"minimize":[171],"their":[172],"impact":[173],"(e.g.,":[174,196],"generational":[175],"collectio":[176],"n":[177],"),":[178],"restrict":[180],"environments":[183],"strict":[186],"subset":[187],"behaviors":[190],"allowed":[191],"by":[192,197,275],"our":[193,271,299],"mutator-observer-style":[194],"enforcing":[198],"type":[200],"system":[201],"disallows":[203],"overprovisioning":[206],"memory).":[207],"We":[208,240,273],"do":[209,241],"expect":[211],"any":[216],"effect":[217],"collection":[220],"practice.":[221],"Instead,":[222],"provides":[224],"first":[226],"mathematically":[227],"answers":[229],"interesting":[232],"questions":[233],"about":[234],"limits":[236],"collection.":[239],"so":[242,257],"via":[243,270],"reductions":[245],"between":[246],"dynamic":[250],"graph":[251,283],"connectivity":[252],"problem":[253],"in":[254,305],"complexity":[255],"theory,":[256],"future":[258],"algorithms":[259],"lower":[261],"bounds":[262],"from":[263,281],"community":[265,286],"transfer":[266],"other":[269],"reductions.":[272],"end":[274],"describing":[276],"how":[277],"adapt":[279],"techniques":[280],"data":[284],"structures":[285],"build":[288],"collector":[291],"making":[292],"worst-case":[293],"guarantees":[294],"improve":[296],"performance":[297],"motivating,":[300],"pathologically":[301],"memory-constrained":[302],"scenarios,":[303],"but":[304],"practice":[306],"find":[307],"too":[308],"much":[309],"overhead":[310],"recommend":[312],"use.":[315]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-24T07:32:12.397491","created_date":"2025-10-10T00:00:00"}