{"id":"https://openalex.org/W2980176182","doi":"https://doi.org/10.1145/3360576","title":"Optimal stateless model checking for reads-from equivalence under sequential consistency","display_name":"Optimal stateless model checking for reads-from equivalence under sequential consistency","publication_year":2019,"publication_date":"2019-10-10","ids":{"openalex":"https://openalex.org/W2980176182","doi":"https://doi.org/10.1145/3360576","mag":"2980176182"},"language":"en","primary_location":{"id":"doi:10.1145/3360576","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3360576","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3360576","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/3360576","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047278328","display_name":"Mohamed Faouzi Atig","orcid":"https://orcid.org/0000-0001-8229-3481"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mohamed Faouzi Atig","raw_affiliation_strings":["Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009514870","display_name":"Bengt J\u00f6nsson","orcid":"https://orcid.org/0000-0001-7897-601X"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt Jonsson","raw_affiliation_strings":["Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069008211","display_name":"Magnus L\u00e5ng","orcid":"https://orcid.org/0000-0003-0984-4229"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Magnus L\u00e5ng","raw_affiliation_strings":["Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012871556","display_name":"Tuan Phong Ngo","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Tuan Phong Ngo","raw_affiliation_strings":["Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009640372","display_name":"Konstantinos Sagonas","orcid":"https://orcid.org/0000-0001-9657-0179"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Konstantinos Sagonas","raw_affiliation_strings":["Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5002478680"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":null,"apc_paid":null,"fwci":3.7994,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":{"value":0.94118081,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"3","issue":"OOPSLA","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7302032709121704},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.622911274433136},{"id":"https://openalex.org/keywords/sequential-consistency","display_name":"Sequential consistency","score":0.5752841830253601},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.5403490662574768},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.480074942111969},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.43209919333457947},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.41281840205192566},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.40178775787353516},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3287840485572815},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.3173605799674988},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.28044217824935913},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.27012795209884644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2646867632865906},{"id":"https://openalex.org/keywords/consistency-model","display_name":"Consistency model","score":0.23529091477394104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7302032709121704},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.622911274433136},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.5752841830253601},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.5403490662574768},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.480074942111969},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.43209919333457947},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.41281840205192566},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40178775787353516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3287840485572815},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3173605799674988},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.28044217824935913},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27012795209884644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2646867632865906},{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.23529091477394104},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3360576","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3360576","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3360576","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:DiVA.org:uu-396320","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-396320","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:figshare.com:article/27592971","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1145/3360576","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3360576","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3360576","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/16","display_name":"Peace, Justice and strong institutions","score":0.699999988079071}],"awards":[{"id":"https://openalex.org/G1230471481","display_name":null,"funder_award_id":"621-2017-04812","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G2881692559","display_name":null,"funder_award_id":"UPMARC","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G3682786331","display_name":null,"funder_award_id":"aSSIsT","funder_id":"https://openalex.org/F4320327257","funder_display_name":"Stiftelsen f\u00f6r Strategisk Forskning"},{"id":"https://openalex.org/G6808811420","display_name":null,"funder_award_id":"aSSIsT","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"}],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320327257","display_name":"Stiftelsen f\u00f6r Strategisk Forskning","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2980176182.pdf","grobid_xml":"https://content.openalex.org/works/W2980176182.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1481985818","https://openalex.org/W1490356539","https://openalex.org/W1528441743","https://openalex.org/W1556323883","https://openalex.org/W1589421353","https://openalex.org/W1719093023","https://openalex.org/W1986463648","https://openalex.org/W1990838770","https://openalex.org/W1999288406","https://openalex.org/W2008078972","https://openalex.org/W2016300863","https://openalex.org/W2024875714","https://openalex.org/W2048164876","https://openalex.org/W2051016152","https://openalex.org/W2054739713","https://openalex.org/W2055963247","https://openalex.org/W2065675749","https://openalex.org/W2161466480","https://openalex.org/W2169870841","https://openalex.org/W2171076136","https://openalex.org/W2285599141","https://openalex.org/W2347106652","https://openalex.org/W2528919074","https://openalex.org/W2734336505","https://openalex.org/W2734789924","https://openalex.org/W2747419197","https://openalex.org/W2778029444","https://openalex.org/W2778798134","https://openalex.org/W2884199446","https://openalex.org/W2887814217","https://openalex.org/W2964156448","https://openalex.org/W2979942385","https://openalex.org/W4232306982","https://openalex.org/W4250620090","https://openalex.org/W4254906220"],"related_works":["https://openalex.org/W2497440208","https://openalex.org/W2123855908","https://openalex.org/W2275529935","https://openalex.org/W4290062159","https://openalex.org/W2150223718","https://openalex.org/W1555579555","https://openalex.org/W4250753400","https://openalex.org/W4301894417","https://openalex.org/W3010022189","https://openalex.org/W2128822791"],"abstract_inverted_index":{"We":[0,124,176,247],"present":[1,125,249],"a":[2,27,161,167,191],"new":[3,192,256],"approach":[4],"for":[5,74,130,187],"stateless":[6],"model":[7],"checking":[8],"(SMC)":[9],"of":[10,58,219],"multithreaded":[11],"programs":[12,152,210,236],"under":[13],"Sequential":[14],"Consistency":[15],"(SC)":[16],"semantics.":[17],"To":[18],"combat":[19],"state-space":[20],"explosion,":[21],"SMC":[22,91,128,185,207,274],"is":[23,89,94,133,158,241,258],"often":[24],"equipped":[25],"with":[26,190],"partial-order":[28],"reduction":[29],"technique,":[30],"which":[31,78,93],"defines":[32],"an":[33,184,232],"equivalence":[34,46,57,109,148,240,257],"on":[35,150],"executions,":[36,220],"and":[37,70,111,136,228,275],"only":[38,80],"needs":[39],"to":[40,86,214,272],"explore":[41],"one":[42,104],"execution":[43,105],"in":[44,97,106,114,138,173,209,235],"each":[45,107],"class.":[47,123],"Recently,":[48],"it":[49,101,118,143],"has":[50],"been":[51],"observed":[52],"that":[53,100,117,132,142,153,164,200,268],"the":[54,81,98,115,126,179,205,216,238,244,255,264],"commonly":[55],"used":[56],"Mazurkiewicz":[59],"traces":[60],"can":[61,171],"be":[62],"coarsened":[63],"but":[64],"still":[65],"cover":[66],"all":[67,151],"program":[68],"crashes":[69],"assertion":[71],"violations.":[72],"However,":[73],"this":[75],"coarser":[76,242],"equivalence,":[77],"preserves":[79],"reads-from":[82,108,169,239],"relation":[83,170],"from":[84],"writes":[85],"reads,":[87],"there":[88],"no":[90],"algorithm":[92,129,180],"(i)":[95],"optimal":[96,135],"sense":[99,116],"explores":[102],"precisely":[103],"class,":[110],"(ii)":[112],"efficient":[113,137],"spends":[119,144],"polynomial":[120,145],"effort":[121],"per":[122,147],"first":[127],"SC":[131],"both":[134],"practice":[139],",":[140],"meaning":[141],"time":[146],"class":[149],"we":[154],"have":[155,177],"tried.":[156],"This":[157],"achieved":[159],"by":[160,181,231],"novel":[162],"test":[163],"checks":[165],"whether":[166],"given":[168],"arise":[172],"some":[174],"execution.":[175],"implemented":[178],"extending":[182],"Nidhugg,":[183],"tool":[186],"C/C++":[188],"programs,":[189],"mode":[193],"called":[194],"rfsc.":[195],"Our":[196],"experimental":[197],"results":[198],"show":[199],"Nidhugg/rfsc,":[201],"although":[202],"slower":[203],"than":[204,226,243],"fastest":[206],"tools":[208,212],"where":[211,237,254],"happen":[213],"examine":[215],"same":[217],"number":[218],"always":[221],"scales":[222],"similarly":[223],"or":[224],"better":[225],"them,":[227],"outperforms":[229],"them":[230],"exponential":[233],"factor":[234],"standard":[245],"one.":[246],"also":[248],"two":[250],"non-trivial":[251],"use":[252],"cases":[253],"particularly":[259],"effective,":[260],"as":[261,263],"well":[262],"significant":[265],"performance":[266],"advantage":[267],"Nidhugg/rfsc":[269],"offers":[270],"compared":[271],"state-of-the-art":[273],"systematic":[276],"concurrency":[277],"testing":[278],"tools.":[279]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}