{"id":"https://openalex.org/W7154375229","doi":"https://doi.org/10.48550/arxiv.2604.09589","title":"Complexity of Consistency Testing for the Release-Acquire Semantics","display_name":"Complexity of Consistency Testing for the Release-Acquire Semantics","publication_year":2026,"publication_date":"2026-03-02","ids":{"openalex":"https://openalex.org/W7154375229","doi":"https://doi.org/10.48550/arxiv.2604.09589"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.09589","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09589","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.09589","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103030366","display_name":"R. Govind","orcid":"https://orcid.org/0000-0002-1634-5893"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Govind, R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017975064","display_name":"S. Krishna","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krishna, S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092829024","display_name":"Sanchari Sil","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sil, Sanchari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047476786","display_name":"B. Srivathsan","orcid":"https://orcid.org/0000-0003-2666-0691"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Srivathsan, B.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.22020000219345093,"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.22020000219345093,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.18850000202655792,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.14920000731945038,"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/complement","display_name":"Complement (music)","score":0.4731999933719635},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.4643000066280365},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43059998750686646},{"id":"https://openalex.org/keywords/sequential-consistency","display_name":"Sequential consistency","score":0.4162999987602234},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.3546999990940094},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.337799996137619},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.33149999380111694},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.33149999380111694}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5690000057220459},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4731999933719635},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.4643000066280365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45339998602867126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43059998750686646},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.4162999987602234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41519999504089355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36059999465942383},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.3546999990940094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3499999940395355},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.2669000029563904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26489999890327454},{"id":"https://openalex.org/C31388003","wikidata":"https://www.wikidata.org/wiki/Q7624548","display_name":"Strong consistency","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.09589","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09589","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.09589","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09589","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.40501534938812256,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,76],"a":[1,21,25],"seminal":[2],"work,":[3],"Gibbons":[4],"and":[5,18,53,69,151,173],"Korach":[6],"studied":[7],"the":[8,31,47,60,64,70,81,84,88,138,148,162,169,175],"complexity":[9],"of":[10,16,20,62,66,87,171,177],"deciding":[11],"whether":[12],"an":[13],"observed":[14],"sequence":[15],"reads":[17],"writes":[19],"multi-threaded":[22],"program":[23],"admits":[24],"sequentially":[26],"consistent":[27],"interleaving.":[28],"They":[29],"showed":[30],"problem":[32,48,82,139],"to":[33,147],"be":[34,101],"NP-hard":[35,125,141],"even":[36,58],"under":[37,161],"strong":[38],"syntactic":[39],"restrictions.":[40],"More":[41],"recently,":[42],"Chakraborty":[43],"et":[44],"al.":[45],"considered":[46],"for":[49,83,126],"weak":[50],"memory":[51,67,90,107,178],"models":[52],"proved":[54],"that":[55,97],"NP-hardness":[56],"remains":[57],"when":[59,105,142],"number":[61,65,170,176],"threads,":[63,172],"locations,":[68],"value":[71],"domain":[72],"are":[73,118],"all":[74],"bounded.":[75],"this":[77,121,131],"paper":[78],"we":[79],"revisit":[80],"release-acquire":[85],"variants":[86],"C11":[89],"model.":[91],"Our":[92],"main":[93],"positive":[94],"result":[95],"is":[96,109,123,140],"consistency":[98],"testing":[99],"can":[100],"done":[102],"in":[103],"polynomial-time":[104],"each":[106],"location":[108,156],"written":[110],"by":[111],"at":[112],"most":[113],"one":[114],"thread":[115],"(multiple":[116],"readers":[117],"allowed).":[119],"Notably,":[120],"restriction":[122],"already":[124],"sequential":[127],"consistency.":[128],"We":[129],"complement":[130],"upper":[132],"bound":[133],"with":[134],"tight":[135],"hardness":[136],"results:":[137],"two":[143],"threads":[144],"may":[145],"write":[146],"same":[149],"location,":[150],"allowing":[152],"three":[153],"writers":[154],"per":[155],"rules":[157],"out":[158],"2^{o(k)}.n^{O(1)}":[159],"algorithms":[160],"Exponential":[163],"Time":[164],"Hypothesis,":[165],"where":[166],"k":[167],"denotes":[168],"n":[174],"operations.":[179]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-15T00:00:00"}