{"id":"https://openalex.org/W2898118897","doi":"https://doi.org/10.1145/3290371","title":"Decoupling lock-free data structures from memory reclamation for static analysis","display_name":"Decoupling lock-free data structures from memory reclamation for static analysis","publication_year":2019,"publication_date":"2019-01-02","ids":{"openalex":"https://openalex.org/W2898118897","doi":"https://doi.org/10.1145/3290371","mag":"2898118897"},"language":"en","primary_location":{"id":"doi:10.1145/3290371","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290371","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290371","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","license_id":"https://openalex.org/licenses/cc-by","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/3290371","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085643838","display_name":"Roland Meyer","orcid":"https://orcid.org/0000-0001-8495-671X"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Roland Meyer","raw_affiliation_strings":["TU Braunschweig, Germany"],"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035264899","display_name":"Sebastian Wolff","orcid":"https://orcid.org/0000-0002-3974-7713"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Wolff","raw_affiliation_strings":["TU Braunschweig, Germany"],"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085643838"],"corresponding_institution_ids":["https://openalex.org/I94509681"],"apc_list":null,"apc_paid":null,"fwci":1.2379,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.80615356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"3","issue":"POPL","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T13471","display_name":"Cognitive Functions and Memory","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9901000261306763,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8664898872375488},{"id":"https://openalex.org/keywords/linearizability","display_name":"Linearizability","score":0.7666655778884888},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.6612887382507324},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6535677313804626},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.6404810547828674},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5558110475540161},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.49587902426719666},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4912392497062683},{"id":"https://openalex.org/keywords/memory-leak","display_name":"Memory leak","score":0.42751365900039673},{"id":"https://openalex.org/keywords/memory-address","display_name":"Memory address","score":0.41810327768325806},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35459020733833313},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.3408791422843933},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30422455072402954},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.18250802159309387},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.16003873944282532}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8664898872375488},{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.7666655778884888},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.6612887382507324},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6535677313804626},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.6404810547828674},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5558110475540161},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.49587902426719666},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4912392497062683},{"id":"https://openalex.org/C156731835","wikidata":"https://www.wikidata.org/wiki/Q751740","display_name":"Memory leak","level":4,"score":0.42751365900039673},{"id":"https://openalex.org/C153247305","wikidata":"https://www.wikidata.org/wiki/Q835713","display_name":"Memory address","level":3,"score":0.41810327768325806},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35459020733833313},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.3408791422843933},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30422455072402954},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.18250802159309387},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.16003873944282532},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3290371","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290371","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290371","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","license_id":"https://openalex.org/licenses/cc-by","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/3290371","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290371","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290371","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","license_id":"https://openalex.org/licenses/cc-by","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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2898118897.pdf","grobid_xml":"https://content.openalex.org/works/W2898118897.grobid-xml"},"referenced_works_count":91,"referenced_works":["https://openalex.org/W6969004","https://openalex.org/W20815996","https://openalex.org/W27871822","https://openalex.org/W85669090","https://openalex.org/W204503899","https://openalex.org/W995851627","https://openalex.org/W1214620947","https://openalex.org/W1511438294","https://openalex.org/W1516842532","https://openalex.org/W1520380662","https://openalex.org/W1527710292","https://openalex.org/W1533529458","https://openalex.org/W1537449998","https://openalex.org/W1540997098","https://openalex.org/W1553228708","https://openalex.org/W1591718490","https://openalex.org/W1592188038","https://openalex.org/W1594023774","https://openalex.org/W1602156367","https://openalex.org/W1607976554","https://openalex.org/W1818449680","https://openalex.org/W1824790454","https://openalex.org/W1867941603","https://openalex.org/W1919495026","https://openalex.org/W1965614349","https://openalex.org/W1974122097","https://openalex.org/W1981393723","https://openalex.org/W1981439955","https://openalex.org/W1986732422","https://openalex.org/W2009098105","https://openalex.org/W2012171200","https://openalex.org/W2022228153","https://openalex.org/W2032811723","https://openalex.org/W2038189819","https://openalex.org/W2045183833","https://openalex.org/W2048605787","https://openalex.org/W2053990855","https://openalex.org/W2056841789","https://openalex.org/W2063666348","https://openalex.org/W2063798543","https://openalex.org/W2069398819","https://openalex.org/W2089064888","https://openalex.org/W2090551028","https://openalex.org/W2091642429","https://openalex.org/W2092137580","https://openalex.org/W2099470183","https://openalex.org/W2101939036","https://openalex.org/W2103082046","https://openalex.org/W2103524479","https://openalex.org/W2108915642","https://openalex.org/W2109717427","https://openalex.org/W2127717454","https://openalex.org/W2127976210","https://openalex.org/W2131041673","https://openalex.org/W2132818695","https://openalex.org/W2137140687","https://openalex.org/W2137507504","https://openalex.org/W2145505243","https://openalex.org/W2147760702","https://openalex.org/W2149074552","https://openalex.org/W2157062942","https://openalex.org/W2160043001","https://openalex.org/W2161889908","https://openalex.org/W2166580349","https://openalex.org/W2167598841","https://openalex.org/W2187800381","https://openalex.org/W2248307790","https://openalex.org/W2293847997","https://openalex.org/W2322058956","https://openalex.org/W2414249360","https://openalex.org/W2471811726","https://openalex.org/W2491434057","https://openalex.org/W2512930100","https://openalex.org/W2562187073","https://openalex.org/W2563167692","https://openalex.org/W2581534302","https://openalex.org/W2592567368","https://openalex.org/W2596852931","https://openalex.org/W2613173755","https://openalex.org/W2623959073","https://openalex.org/W2727990967","https://openalex.org/W2734789924","https://openalex.org/W2738549499","https://openalex.org/W2780286008","https://openalex.org/W2780745892","https://openalex.org/W2788506055","https://openalex.org/W2899389232","https://openalex.org/W2951282943","https://openalex.org/W3100495532","https://openalex.org/W4239018153","https://openalex.org/W4253344502"],"related_works":["https://openalex.org/W2145076998","https://openalex.org/W2188240052","https://openalex.org/W2559817971","https://openalex.org/W2007630246","https://openalex.org/W2011342976","https://openalex.org/W2182829270","https://openalex.org/W2592247214","https://openalex.org/W4384948881","https://openalex.org/W54833955","https://openalex.org/W2064784696"],"abstract_inverted_index":{"Verification":[0],"of":[1,7,24,51,62,67,75,110,120,124,146,194,211],"concurrent":[2,52,76,92],"data":[3,53,77,93,112,137],"structures":[4,78,94],"is":[5,48,56,182],"one":[6],"the":[8,22,25,49,60,73,108,111,121,125,136,140,144,147,153,198,209,216],"most":[9],"challenging":[10],"tasks":[11,105,156],"in":[12,59],"software":[13],"verification.":[14],"The":[15,43,65,114,128],"topic":[16],"has":[17],"received":[18],"considerable":[19],"attention":[20],"over":[21],"course":[23],"last":[26],"decade.":[27],"Nevertheless,":[28],"human-driven":[29],"techniques":[30],"remain":[31],"cumbersome":[32],"and":[33,95,188,197,205],"notoriously":[34],"difficult":[35],"while":[36],"automated":[37,80,159],"approaches":[38],"suffer":[39],"from":[40],"limited":[41],"applicability.":[42],"main":[44],"obstacle":[45],"for":[46,90,158,201],"automation":[47],"complexity":[50,74],"structures.":[54],"This":[55],"particularly":[57],"true":[58],"absence":[61],"garbage":[63],"collection.":[64],"intricacy":[66],"lock-free":[68],"memory":[69,97,126,148,180],"management":[70,98,149],"paired":[71],"with":[72],"makes":[79],"verification":[81,104,155,170],"prohibitive.":[82],"In":[83],"this":[84,132],"work":[85],"we":[86,161,214],"present":[87],"a":[88,163,169,178],"method":[89],"verifying":[91],"their":[96],"separately.":[99],"We":[100,166,184],"suggest":[101],"two":[102],"simpler":[103],"that":[106,168],"imply":[107],"correctness":[109],"structure.":[113],"first":[115,217],"task":[116,130],"establishes":[117],"an":[118],"over-approximation":[119,133],"reclamation":[122],"behavior":[123],"management.":[127],"second":[129,164],"exploits":[131],"to":[134,142,173,191,218],"verify":[135,192,219],"structure":[138],"without":[139],"need":[141],"consider":[143,174],"implementation":[145],"itself.":[150],"To":[151,208],"make":[152],"resulting":[154],"tractable":[157],"techniques,":[160],"establish":[162],"result.":[165],"show":[167],"tool":[171],"needs":[172],"only":[175],"executions":[176],"where":[177],"single":[179],"location":[181],"reused.":[183],"implemented":[185],"our":[186,212],"approach":[187],"were":[189],"able":[190],"linearizability":[193],"Michael&Scott's":[195],"queue":[196,200],"DGLM":[199],"both":[202],"hazard":[203],"pointers":[204],"epoch-based":[206],"reclamation.":[207],"best":[210],"knowledge,":[213],"are":[215],"such":[220],"implementations":[221],"fully":[222],"automatically.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}