{"id":"https://openalex.org/W2293159724","doi":"https://doi.org/10.1145/2837614.2837616","title":"A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions","display_name":"A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions","publication_year":2016,"publication_date":"2016-01-07","ids":{"openalex":"https://openalex.org/W2293159724","doi":"https://doi.org/10.1145/2837614.2837616","mag":"2293159724"},"language":"en","primary_location":{"id":"doi:10.1145/2837614.2837616","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837614.2837616","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.repository.cam.ac.uk/bitstreams/db585537-9891-45a3-8c5a-221b61e6764e/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027766872","display_name":"Jean Pichon-Pharabod","orcid":"https://orcid.org/0000-0002-4442-6543"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jean Pichon-Pharabod","raw_affiliation_strings":["University of Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"University of Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083405043","display_name":"Peter Sewell","orcid":"https://orcid.org/0000-0001-9352-1013"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter Sewell","raw_affiliation_strings":["University of Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"University of Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027766872"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":14.4469,"has_fulltext":true,"cited_by_count":72,"citation_normalized_percentile":{"value":0.9938824,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"622","last_page":"633"},"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/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/T10126","display_name":"Logic, programming, and type systems","score":0.9954000115394592,"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.8569295406341553},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.8479518890380859},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.8025552034378052},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6284691095352173},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.5687926411628723},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5368291735649109},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.4856227934360504},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4793480336666107},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.47586697340011597},{"id":"https://openalex.org/keywords/memory-model","display_name":"Memory model","score":0.4405367374420166},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.41507595777511597},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4105614721775055},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39375922083854675},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.19199401140213013}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8569295406341553},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8479518890380859},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8025552034378052},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6284691095352173},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.5687926411628723},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5368291735649109},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.4856227934360504},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4793480336666107},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.47586697340011597},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.4405367374420166},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.41507595777511597},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4105614721775055},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39375922083854675},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.19199401140213013}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2837614.2837616","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837614.2837616","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:www.repository.cam.ac.uk:1810/285458","is_oa":true,"landing_page_url":"https://www.repository.cam.ac.uk/handle/1810/285458","pdf_url":"https://www.repository.cam.ac.uk/bitstreams/db585537-9891-45a3-8c5a-221b61e6764e/download","source":{"id":"https://openalex.org/S4306401777","display_name":"Apollo (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.17863/cam.32816","is_oa":true,"landing_page_url":"https://doi.org/10.17863/cam.32816","pdf_url":null,"source":{"id":"https://openalex.org/S7407050737","display_name":"Apollo","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:www.repository.cam.ac.uk:1810/285458","is_oa":true,"landing_page_url":"https://www.repository.cam.ac.uk/handle/1810/285458","pdf_url":"https://www.repository.cam.ac.uk/bitstreams/db585537-9891-45a3-8c5a-221b61e6764e/download","source":{"id":"https://openalex.org/S4306401777","display_name":"Apollo (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2335238807","display_name":null,"funder_award_id":"EP/K008528","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5860500101","display_name":"REMS: Rigorous Engineering for Mainstream Systems","funder_award_id":"EP/K008528/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7401479227","display_name":null,"funder_award_id":"EP/K008528/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2293159724.pdf","grobid_xml":"https://content.openalex.org/works/W2293159724.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W867008410","https://openalex.org/W1482397304","https://openalex.org/W1498264241","https://openalex.org/W1589643726","https://openalex.org/W1595974273","https://openalex.org/W1967564401","https://openalex.org/W1990191223","https://openalex.org/W2000659103","https://openalex.org/W2003556922","https://openalex.org/W2014708731","https://openalex.org/W2016012949","https://openalex.org/W2030159266","https://openalex.org/W2054391605","https://openalex.org/W2058943117","https://openalex.org/W2091085450","https://openalex.org/W2107699547","https://openalex.org/W2111858071","https://openalex.org/W2117502039","https://openalex.org/W2132117132","https://openalex.org/W2134326845","https://openalex.org/W2138074470","https://openalex.org/W2152179894","https://openalex.org/W2152885346","https://openalex.org/W2987803397","https://openalex.org/W4234066571","https://openalex.org/W4240322740","https://openalex.org/W4246957455","https://openalex.org/W4251987281","https://openalex.org/W4256041698"],"related_works":["https://openalex.org/W2271904544","https://openalex.org/W2962876128","https://openalex.org/W1667758182","https://openalex.org/W4214787291","https://openalex.org/W4382891113","https://openalex.org/W1496993747","https://openalex.org/W3082419158","https://openalex.org/W4293452374","https://openalex.org/W4386591085","https://openalex.org/W4254928411"],"abstract_inverted_index":{"Despite":[0],"much":[1],"research":[2],"on":[3],"concurrent":[4,42,236],"programming":[5,221,237],"languages,":[6],"especially":[7],"for":[8,108,226,235],"Java":[9,245],"and":[10,57,66,114,117,164,170,203,206,215,244],"C/C++,":[11],"we":[12,94],"still":[13,127],"do":[14,72],"not":[15,73],"have":[16],"a":[17,54,62,96,105,109,121,187,201,231],"satisfactory":[18],"definition":[19],"of":[20,124,151,155,160,168,180],"their":[21],"semantics,":[22,239],"one":[23],"that":[24,65,69,87,99,119,174,223],"admits":[25,120],"all":[26,89,159],"common":[27,193],"optimisations":[28,71],"without":[29],"also":[30,134],"admitting":[31],"undesired":[32],"behaviour.":[33,141,195],"Especially":[34],"problematic":[35],"are":[36,184],"the":[37,67,129,152,181,220,241],"``thin-air''":[38],"examples":[39],"involving":[40],"high-performance":[41],"accesses,":[43,116],"such":[44],"as":[45],"C/C++11":[46,50,224,243],"relaxed":[47,213],"atomics.":[48],"The":[49,142,196],"model":[51],"is":[52,145,198],"in":[53,79,200],"per-candidate-execution":[55],"style,":[56],"previous":[58],"work":[59],"has":[60],"identified":[61],"tension":[63],"between":[64],"fact":[68],"compiler":[70],"operate":[74,83],"over":[75,84,173],"single":[76],"candidate":[77],"executions":[78],"isolation;":[80],"rather,":[81],"they":[82],"syntactic":[85],"representations":[86],"represent":[88],"executions.":[90],"In":[91],"this":[92,101,227],"paper":[93],"propose":[95],"novel":[97],"approach":[98],"circumvents":[100],"difficulty.":[102],"We":[103],"define":[104],"concurrency":[106],"semantics":[107,197],"core":[110],"calculus,":[111],"including":[112],"relaxed-atomic":[113],"non-atomic":[115],"locks,":[118],"wide":[122],"range":[123],"optimisation":[125,177],"while":[126],"forbidding":[128],"classic":[130],"thin-air":[131],"examples.":[132],"It":[133,229],"addresses":[135],"other":[136],"problems":[137],"relating":[138],"to":[139,146,165,175,191,208,218],"undefined":[140],"basic":[143],"idea":[144],"use":[147],"an":[148],"event-structure":[149],"representation":[150],"current":[153,212,242],"state":[154],"each":[156],"thread,":[157],"capturing":[158],"its":[161],"potential":[162,232],"executions,":[163],"permit":[166],"interleaving":[167],"execution":[169],"transformation":[171],"steps":[172],"reflect":[176,192],"(possibly":[178],"dynamic)":[179],"code.":[182],"These":[183],"combined":[185],"with":[186],"non-multi-copy-atomic":[188],"storage":[189],"subsystem,":[190],"hardware":[194,214],"defined":[199],"mechanised":[202],"executable":[204],"form,":[205],"designed":[207],"be":[209],"implementable":[210],"above":[211],"strong":[216],"enough":[217],"support":[219],"idioms":[222],"does":[225],"fragment.":[228],"offers":[230],"way":[233],"forward":[234],"language":[238],"beyond":[240],"models.":[246]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":10}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}