{"id":"https://openalex.org/W4387674148","doi":"https://doi.org/10.1145/3622820","title":"Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent Memory","display_name":"Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent Memory","publication_year":2023,"publication_date":"2023-10-16","ids":{"openalex":"https://openalex.org/W4387674148","doi":"https://doi.org/10.1145/3622820"},"language":"en","primary_location":{"id":"doi:10.1145/3622820","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3622820","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3622820","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/3622820","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040883849","display_name":"Simon Friis Vindum","orcid":"https://orcid.org/0000-0002-4617-4976"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Simon Friis Vindum","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-4617-4976","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-1320-0098","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.73,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84273764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"7","issue":"OOPSLA2","first_page":"632","last_page":"657"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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/T11424","display_name":"Security and Verification in Computing","score":0.9995999932289124,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.9459360837936401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7284160256385803},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5266225934028625},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.48680517077445984},{"id":"https://openalex.org/keywords/memory-safety","display_name":"Memory safety","score":0.46918463706970215},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4356750249862671},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.41604551672935486},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32463425397872925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10511839389801025}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.9459360837936401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7284160256385803},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5266225934028625},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.48680517077445984},{"id":"https://openalex.org/C28180684","wikidata":"https://www.wikidata.org/wiki/Q4080983","display_name":"Memory safety","level":3,"score":0.46918463706970215},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4356750249862671},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.41604551672935486},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32463425397872925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10511839389801025},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3622820","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3622820","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3622820","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:pure.atira.dk:publications/03f75309-bb4e-47a1-9a69-ad1fcbf81211","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/03f75309-bb4e-47a1-9a69-ad1fcbf81211","pdf_url":"https://pure.au.dk/ws/files/417151655/3622820.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Vindum, S F & Birkedal, L 2023, 'Spirea : A Mechanized Concurrent Separation Logic for Weak Persistent Memory', Proceedings of the ACM on Programming Languages , vol. 7, no. OOPSLA2, 244, pp. 632-657. https://doi.org/10.1145/3622820","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire/03f75309-bb4e-47a1-9a69-ad1fcbf81211","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/files/417151655/3622820.pdf","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Vindum, S F & Birkedal, L 2023, 'Spirea : A Mechanized Concurrent Separation Logic for Weak Persistent Memory', Proceedings of the ACM on Programming Languages , vol. 7, no. OOPSLA2, 244, pp. 632-657. https://doi.org/10.1145/3622820","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3622820","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3622820","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3622820","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":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5799999833106995}],"awards":[{"id":"https://openalex.org/G6851704783","display_name":null,"funder_award_id":"25804","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G899382969","display_name":"Compositional Higher-Order Reasoning about Distributed Systems","funder_award_id":"101096090","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387674148.pdf","grobid_xml":"https://content.openalex.org/works/W4387674148.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W2014708731","https://openalex.org/W2113637091","https://openalex.org/W2168397157","https://openalex.org/W2294707073","https://openalex.org/W2511114427","https://openalex.org/W2562833768","https://openalex.org/W2727429054","https://openalex.org/W2734941459","https://openalex.org/W2787794676","https://openalex.org/W2901454403","https://openalex.org/W2979682152","https://openalex.org/W2982041059","https://openalex.org/W2994905145","https://openalex.org/W2996634758","https://openalex.org/W3010663313","https://openalex.org/W3011296477","https://openalex.org/W3033595267","https://openalex.org/W3044012749","https://openalex.org/W3108522311","https://openalex.org/W3117953372","https://openalex.org/W3130392236","https://openalex.org/W3162223895","https://openalex.org/W3173474899","https://openalex.org/W3195812638","https://openalex.org/W4226043713","https://openalex.org/W4250281317","https://openalex.org/W4281945852","https://openalex.org/W6712319493","https://openalex.org/W6894164481"],"related_works":["https://openalex.org/W2130970533","https://openalex.org/W4232666937","https://openalex.org/W2620046709","https://openalex.org/W2963709481","https://openalex.org/W2169037418","https://openalex.org/W4387674148","https://openalex.org/W1922844761","https://openalex.org/W2913100775","https://openalex.org/W1517558204","https://openalex.org/W4285070015"],"abstract_inverted_index":{"Weak":[0],"persistent":[1,62,157],"memory":[2,63],"(a.k.a.":[3],"non-volatile":[4],"memory)":[5],"is":[6,66,98,160],"an":[7],"emerging":[8],"technology":[9],"that":[10],"offers":[11],"fast":[12],"byte-addressable":[13],"durable":[14,141,164],"main":[15],"memory.":[16,158],"A":[17],"wealth":[18],"of":[19,57,111,139],"algorithms":[20],"and":[21,71,75,92,95,106,137,151],"libraries":[22],"has":[23,36],"been":[24,168],"developed":[25],"to":[26,38,121,156],"explore":[27],"this":[28,35,45],"exciting":[29],"technology.":[30],"As":[31],"noted":[32],"by":[33,76],"others,":[34],"led":[37],"a":[39,60,171],"significant":[40],"verification":[41,56,73],"gap.":[42],"Towards":[43],"closing":[44],"gap,":[46],"we":[47],"present":[48],"Spirea,":[49],"the":[50,69,102,114,148,152,161],"first":[51,162],"concurrent":[52],"separation":[53],"logic":[54,133],"for":[55,108],"programs":[58,94],"under":[59],"weak":[61],"model.":[64],"Spirea":[65,97,120],"based":[67],"on":[68],"Iris":[70,115],"Perennial":[72],"frameworks,":[74],"combining":[77],"features":[78],"from":[79],"these":[80],"logics":[81],"with":[82,113,126,144,170],"novel":[83],"techniques":[84],"it":[85],"supports":[86],"high-level":[87],"modular":[88,127],"reasoning":[89],"about":[90],"crash-safe":[91],"thread-safe":[93],"libraries.":[96],"fully":[99],"mechanized":[100],"in":[101,146],"Coq":[103],"proof":[104],"assistant":[105],"allows":[107],"interactive":[109],"development":[110],"proofs":[112],"Proof":[116],"Mode.":[117],"We":[118,129],"use":[119],"verify":[122,135],"several":[123],"challenging":[124],"examples":[125],"specifications.":[128],"show":[130],"how":[131],"our":[132],"can":[134],"thread-safety":[136],"crash-safety":[138],"non-blocking":[140],"data":[142,165],"structures":[143,166],"null-recovery,":[145],"particular":[147],"Treiber":[149],"stack":[150],"Michael-Scott":[153],"queue":[154],"adapted":[155],"This":[159],"time":[163],"have":[167],"verified":[169],"program":[172],"logic.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}