{"id":"https://openalex.org/W4379537219","doi":"https://doi.org/10.1145/3591275","title":"Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic","display_name":"Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic","publication_year":2023,"publication_date":"2023-06-06","ids":{"openalex":"https://openalex.org/W4379537219","doi":"https://doi.org/10.1145/3591275"},"language":"en","primary_location":{"id":"doi:10.1145/3591275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591275","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/3591275","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063959915","display_name":"Ike Mulder","orcid":"https://orcid.org/0000-0001-9926-9736"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ike Mulder","raw_affiliation_strings":["Radboud University Nijmegen, Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-9926-9736","affiliations":[{"raw_affiliation_string":"Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051929557","display_name":"\u0141ukasz Czajka","orcid":"https://orcid.org/0000-0001-8083-4280"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"\u0141ukasz Czajka","raw_affiliation_strings":["TU Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0001-8083-4280","affiliations":[{"raw_affiliation_string":"TU Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029418370","display_name":"Robbert Krebbers","orcid":"https://orcid.org/0000-0002-1185-5237"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Robbert Krebbers","raw_affiliation_strings":["Radboud University Nijmegen, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1185-5237","affiliations":[{"raw_affiliation_string":"Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3263,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63380524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"7","issue":"PLDI","first_page":"1340","last_page":"1364"},"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.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9973999857902527,"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/separation-logic","display_name":"Separation logic","score":0.7502615451812744},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7008510231971741},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6110817193984985},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.540298581123352},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.48806822299957275},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4494915008544922},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.4410644769668579},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37645769119262695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30903780460357666}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.7502615451812744},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7008510231971741},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6110817193984985},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.540298581123352},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48806822299957275},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4494915008544922},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4410644769668579},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37645769119262695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30903780460357666},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3591275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591275","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"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/294788","is_oa":true,"landing_page_url":"https://hdl.handle.net/2066/294788","pdf_url":"https://repository.ubn.ru.nl//bitstream/handle/2066/294788/294788.pdf","source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article / Letter to editor"}],"best_oa_location":{"id":"doi:10.1145/3591275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591275","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":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/1","display_name":"No poverty"}],"awards":[{"id":"https://openalex.org/G7010378412","display_name":null,"funder_award_id":"016.Veni","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8941266395","display_name":null,"funder_award_id":"016.Veni.192.259","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4379537219.pdf","grobid_xml":"https://content.openalex.org/works/W4379537219.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W39637947","https://openalex.org/W75891272","https://openalex.org/W634201214","https://openalex.org/W1486384786","https://openalex.org/W1495368328","https://openalex.org/W1529227536","https://openalex.org/W1558115254","https://openalex.org/W1561567467","https://openalex.org/W1562865234","https://openalex.org/W1565541828","https://openalex.org/W1568501149","https://openalex.org/W1596469673","https://openalex.org/W1600923511","https://openalex.org/W1603245130","https://openalex.org/W1846589774","https://openalex.org/W1981393723","https://openalex.org/W2001738739","https://openalex.org/W2008132476","https://openalex.org/W2036267700","https://openalex.org/W2049764332","https://openalex.org/W2070324762","https://openalex.org/W2076859913","https://openalex.org/W2093111544","https://openalex.org/W2125398300","https://openalex.org/W2130162474","https://openalex.org/W2132761501","https://openalex.org/W2137628566","https://openalex.org/W2138404963","https://openalex.org/W2141978322","https://openalex.org/W2144482530","https://openalex.org/W2147323041","https://openalex.org/W2293455754","https://openalex.org/W2294722445","https://openalex.org/W2309670657","https://openalex.org/W2397043727","https://openalex.org/W2509578035","https://openalex.org/W2562833768","https://openalex.org/W2596377803","https://openalex.org/W2736012496","https://openalex.org/W2770855842","https://openalex.org/W2784656124","https://openalex.org/W2885030506","https://openalex.org/W2901454403","https://openalex.org/W2999161693","https://openalex.org/W3139860392","https://openalex.org/W3174107386","https://openalex.org/W3211410006","https://openalex.org/W4233335757","https://openalex.org/W4237730680","https://openalex.org/W4245729501","https://openalex.org/W4246191294","https://openalex.org/W4253630760","https://openalex.org/W4281711013","https://openalex.org/W4362659591","https://openalex.org/W6931663944"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W1631221657","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W1525406239","https://openalex.org/W2165970356","https://openalex.org/W2574359038"],"abstract_inverted_index":{"Concurrent":[0],"separation":[1,188,221],"logic":[2,189,222],"has":[3,120,207],"been":[4,122],"responsible":[5],"for":[6,89,144,165,187,246],"major":[7],"advances":[8],"in":[9,105,159,238],"the":[10,32,43,48,58,61,126,153,160,208,218,239,250],"formal":[11],"verification":[12,33],"of":[13,31,34,60,66,77,162,196,217,257],"fine-grained":[14,36],"concurrent":[15,220],"algorithms":[16],"and":[17,25,56,231,233],"data":[18,45],"structures":[19],"such":[20],"as":[21,74,225],"locks,":[22],"barriers,":[23],"queues,":[24],"reference":[26],"counters.":[27],"The":[28],"key":[29],"ingredient":[30],"a":[35,51,64,75,86,183,193,197],"program":[37],"is":[38,71,203],"an":[39,106,116],"invariant,":[40],"which":[41,109,134,258],"relates":[42],"physical":[44],"representation":[46,53],"(on":[47],"heap)":[49],"to":[50,57,102,112],"logical":[52,78],"(in":[54],"mathematics)":[55],"state":[59],"threads":[62],"(using":[63],"form":[65],"ghost":[67,229],"state).":[68],"An":[69],"invariant":[70],"typically":[72],"represented":[73],"disjunction":[76],"states,":[79],"but":[80],"this":[81],"disjunctive":[82],"nature":[83],"makes":[84],"invariants":[85],"difficult":[87],"target":[88],"automated":[90,145],"verification.":[91],"Current":[92],"approaches":[93],"roughly":[94],"suffer":[95],"from":[96,171,177],"two":[97],"problems.":[98],"They":[99],"use":[100],"backtracking":[101],"introduce":[103],"disjunctions":[104,131,140,156,191],"uninformed":[107],"manner,":[108],"can":[110,135,212,234,260],"lead":[111],"unprovable":[113],"goals":[114],"if":[115],"appropriate":[117],"case":[118],"analysis":[119],"not":[121,204],"made":[123],"before":[124],"choosing":[125],"disjunct.":[127],"Moreover,":[128],"they":[129],"eliminate":[130],"too":[132],"eagerly,":[133],"cause":[136],"poor":[137],"efficiency.":[138],"While":[139,200],"are":[141,157],"no":[142],"problem":[143],"provers":[146],"based":[147,174],"on":[148,175,252],"classical":[149],"(i.e.,":[150],"non-separating)":[151],"logic,":[152],"challenges":[154],"with":[155,190,215,243],"prominent":[158],"study":[161],"proof":[163,241],"automation":[164],"intuitionistic":[166],"logic.":[167],"We":[168,248],"take":[169],"inspiration":[170],"that":[172,210],"area\u2014specifically,":[173],"ideas":[176],"connection":[178,198],"calculus":[179,186,202],",":[180],"we":[181,259],"design":[182],"simple":[184],"multi-succedent":[185],"featuring":[192],"novel":[194],"concept":[195],".":[199],"our":[201],"complete,":[205],"it":[206,211],"advantage":[209],"be":[213,235],"extended":[214],"features":[216],"state-of-the-art":[219],"Iris":[223],"(such":[224],"modalities,":[226],"higher-order":[227],"quantification,":[228],"state,":[230],"invariants),":[232],"implemented":[236],"effectively":[237],"Coq":[240],"assistant":[242],"little":[244],"need":[245],"backtracking.":[247],"evaluate":[249],"practicality":[251],"24":[253],"challenging":[254],"benchmarks,":[255],"14":[256],"verify":[261],"fully":[262],"automatically.":[263]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}