{"id":"https://openalex.org/W4315606551","doi":"https://doi.org/10.1145/3571231","title":"A Compositional Theory of Linearizability","display_name":"A Compositional Theory of Linearizability","publication_year":2023,"publication_date":"2023-01-09","ids":{"openalex":"https://openalex.org/W4315606551","doi":"https://doi.org/10.1145/3571231"},"language":"en","primary_location":{"id":"doi:10.1145/3571231","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571231","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571231","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/3571231","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080211213","display_name":"Arthur Oliveira Vale","orcid":"https://orcid.org/0000-0003-1091-7560"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arthur Oliveira Vale","raw_affiliation_strings":["Yale University, USA"],"raw_orcid":"https://orcid.org/0000-0003-1091-7560","affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070627140","display_name":"Zhong Shao","orcid":"https://orcid.org/0000-0001-8184-7649"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhong Shao","raw_affiliation_strings":["Yale University, USA"],"raw_orcid":"https://orcid.org/0000-0001-8184-7649","affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100725678","display_name":"Yixuan Chen","orcid":"https://orcid.org/0000-0001-8659-8493"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yixuan Chen","raw_affiliation_strings":["Yale University, USA"],"raw_orcid":"https://orcid.org/0000-0001-8659-8493","affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":1.1104,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80223501,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"7","issue":"POPL","first_page":"1089","last_page":"1120"},"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.9997000098228455,"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.9997000098228455,"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.9988999962806702,"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/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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/principle-of-compositionality","display_name":"Principle of compositionality","score":0.9385678768157959},{"id":"https://openalex.org/keywords/linearizability","display_name":"Linearizability","score":0.8758317232131958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7120947241783142},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6659388542175293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5391104817390442},{"id":"https://openalex.org/keywords/atomicity","display_name":"Atomicity","score":0.5378491282463074},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4897446632385254},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.45215415954589844},{"id":"https://openalex.org/keywords/observational-equivalence","display_name":"Observational equivalence","score":0.42804425954818726},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4138373136520386},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1288169026374817},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.08309441804885864}],"concepts":[{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.9385678768157959},{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.8758317232131958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7120947241783142},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6659388542175293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5391104817390442},{"id":"https://openalex.org/C188045909","wikidata":"https://www.wikidata.org/wiki/Q3306359","display_name":"Atomicity","level":3,"score":0.5378491282463074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4897446632385254},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45215415954589844},{"id":"https://openalex.org/C2777721189","wikidata":"https://www.wikidata.org/wiki/Q17121921","display_name":"Observational equivalence","level":2,"score":0.42804425954818726},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4138373136520386},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1288169026374817},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.08309441804885864},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3571231","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571231","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571231","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/3571231","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571231","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571231","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":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5400000214576721}],"awards":[{"id":"https://openalex.org/G3700072604","display_name":null,"funder_award_id":"N66001-21-C-4018","funder_id":"https://openalex.org/F4320338406","funder_display_name":"Naval Information Warfare Center Pacific"},{"id":"https://openalex.org/G536862562","display_name":"SHF: Medium: DeepSEA: A Language for Programming and Synthesizing Certified Software","funder_award_id":"1763399","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5412059031","display_name":null,"funder_award_id":"N66001-21-C-4018","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G7606346664","display_name":null,"funder_award_id":"2019285, 1763399, 2118851","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8557257388","display_name":"FMitF: Track I: ADVERT: Compositional Atomic Specifications for Distributed System Verification","funder_award_id":"2019285","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8889032484","display_name":"PPoSS: Planning: High-Performance Certified Trust for Global-Scale Applications","funder_award_id":"2118851","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"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338406","display_name":"Naval Information Warfare Center Pacific","ror":"https://ror.org/01gs1cg95"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4315606551.pdf","grobid_xml":"https://content.openalex.org/works/W4315606551.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W32293111","https://openalex.org/W75891272","https://openalex.org/W114538605","https://openalex.org/W143008620","https://openalex.org/W175195251","https://openalex.org/W1819989006","https://openalex.org/W1824790454","https://openalex.org/W1870018393","https://openalex.org/W1996605832","https://openalex.org/W2017559473","https://openalex.org/W2023035194","https://openalex.org/W2024189573","https://openalex.org/W2028861803","https://openalex.org/W2030121500","https://openalex.org/W2056634143","https://openalex.org/W2087185080","https://openalex.org/W2092954762","https://openalex.org/W2095770127","https://openalex.org/W2101939036","https://openalex.org/W2106490526","https://openalex.org/W2107067818","https://openalex.org/W2138927523","https://openalex.org/W2139533136","https://openalex.org/W2146242204","https://openalex.org/W2165446401","https://openalex.org/W2236913981","https://openalex.org/W2243405571","https://openalex.org/W2293720230","https://openalex.org/W2293847997","https://openalex.org/W2296665256","https://openalex.org/W2339401772","https://openalex.org/W2547570521","https://openalex.org/W2551973123","https://openalex.org/W2571881501","https://openalex.org/W2596852931","https://openalex.org/W2787750560","https://openalex.org/W2798365728","https://openalex.org/W2799730491","https://openalex.org/W2899662671","https://openalex.org/W2901454403","https://openalex.org/W2996703997","https://openalex.org/W3022736191","https://openalex.org/W3029226113","https://openalex.org/W3031613435","https://openalex.org/W3193924946","https://openalex.org/W3215427419","https://openalex.org/W4225157728","https://openalex.org/W4237730680","https://openalex.org/W4239797127","https://openalex.org/W4241333267","https://openalex.org/W4244463218","https://openalex.org/W4315606551","https://openalex.org/W6604642462"],"related_works":["https://openalex.org/W2963266914","https://openalex.org/W2809225575","https://openalex.org/W3120739902","https://openalex.org/W2413414728","https://openalex.org/W2104046157","https://openalex.org/W1828810364","https://openalex.org/W1587224678","https://openalex.org/W2899230041","https://openalex.org/W1548537923","https://openalex.org/W4315606551"],"abstract_inverted_index":{"Compositionality":[0],"is":[1,24,58,105,115,142,214],"at":[2],"the":[3,30,63,73,93,96,99,106,172,182,190],"core":[4],"of":[5,18,28,33,60,65,68,98,109,126,146,166,171,174,181,186,189],"programming":[6],"languages":[7],"research":[8],"and":[9,103,120,141,151,163,185],"has":[10],"become":[11],"an":[12,187],"important":[13],"goal":[14],"toward":[15],"scalable":[16],"verification":[17],"large":[19],"systems.":[20],"Despite":[21],"that,":[22],"there":[23],"no":[25],"compositional":[26,44,66],"account":[27],"linearizability,":[29,61,175],"gold":[31],"standard":[32],"correctness":[34],"for":[35,46,76,92],"concurrent":[36,48,69],"objects.":[37,49],"In":[38],"this":[39,104,112,129,161,218],"paper,":[40],"we":[41],"develop":[42],"a":[43,54,83,90,123,209],"semantics":[45,207],"linearizable":[47],"We":[50,159,195],"start":[51],"by":[52,204],"showcasing":[53],"common":[55],"issue,":[56],"which":[57],"independent":[59],"in":[62,95,202],"construction":[64,114],"models":[67],"computation:":[70],"interaction":[71],"with":[72,192,208],"neutral":[74],"element":[75],"composition":[77],"can":[78,199],"lead":[79],"to":[80,85,118,122,156,168],"emergent":[81],"behaviors,":[82],"hindrance":[84],"compositionality.":[86],"Category":[87],"theory":[88,173],"provides":[89],"solution":[91],"issue":[94],"form":[97],"Karoubi":[100],"envelope.":[101],"Surprisingly,":[102],"main":[107],"discovery":[108],"our":[110,197,206],"work,":[111],"abstract":[113],"deeply":[116],"related":[117,155],"linearizability":[119,150,167],"leads":[121],"novel":[124],"formulation":[125,131],"it.":[127],"Notably,":[128],"new":[130],"neither":[132],"relies":[133],"on":[134],"atomicity":[135],"nor":[136],"directly":[137],"upon":[138],"happens-before":[139],"ordering":[140],"only":[143],"possible":[144],"because":[145],"compositionality,":[147],"revealing":[148],"that":[149,213],"compositionality":[152],"are":[153],"intrinsically":[154],"each":[157],"other.":[158],"use":[160],"new,":[162],"compositional,":[164],"understanding":[165],"revisit":[169],"much":[170],"providing":[176],"novel,":[177],"simple,":[178],"algebraic":[179],"proofs":[180],"locality":[183],"property":[184],"analogue":[188],"equivalence":[191],"observational":[193],"refinement.":[194],"show":[196],"techniques":[198],"be":[200],"used":[201],"practice":[203],"connecting":[205],"simple":[210],"program":[211],"logic":[212],"nonetheless":[215],"sound":[216],"concerning":[217],"generalized":[219],"linearizability.":[220]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}