{"id":"https://openalex.org/W3108322019","doi":"https://doi.org/10.1145/3485541","title":"The reads-from equivalence for the TSO and PSO memory models","display_name":"The reads-from equivalence for the TSO and PSO memory models","publication_year":2021,"publication_date":"2021-10-15","ids":{"openalex":"https://openalex.org/W3108322019","doi":"https://doi.org/10.1145/3485541","mag":"3108322019"},"language":"en","primary_location":{"id":"doi:10.1145/3485541","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3485541","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3485541","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3485541","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039126260","display_name":"Truc Lam Bui","orcid":null},"institutions":[{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Truc Lam Bui","raw_affiliation_strings":["Comenius University Bratislava, Slovakia","Comenius University Bratislava Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Comenius University Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]},{"raw_affiliation_string":"Comenius University Bratislava Slovakia","institution_ids":["https://openalex.org/I74788687"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":["IST Austria, Austria"],"raw_orcid":"https://orcid.org/0000-0002-4561-241X","affiliations":[{"raw_affiliation_string":"IST Austria, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036098501","display_name":"Tushar Gautam","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tushar Gautam","raw_affiliation_strings":["IIT Bombay, India","IIT, Bombay, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"IIT, Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022252401","display_name":"Andreas Pavlogiannis","orcid":"https://orcid.org/0000-0002-8943-0722"},"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":"Andreas Pavlogiannis","raw_affiliation_strings":["Aarhus University, Denmark","Aarhus University, Denmark;"],"raw_orcid":"https://orcid.org/0000-0002-8943-0722","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Denmark;","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085914523","display_name":"Viktor Toman","orcid":"https://orcid.org/0000-0001-9036-063X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Viktor Toman","raw_affiliation_strings":["IST Austria, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5039126260"],"corresponding_institution_ids":["https://openalex.org/I74788687"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01027607,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"OOPSLA","first_page":"1","last_page":"30"},"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.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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/sequential-consistency","display_name":"Sequential consistency","score":0.7453809976577759},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6166887879371643},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5946170091629028},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.589392364025116},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.5409458875656128},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5175020694732666},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5074533820152283},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3624088764190674},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3619532585144043},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3571244478225708},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34731656312942505},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3376730680465698},{"id":"https://openalex.org/keywords/consistency-model","display_name":"Consistency model","score":0.2787824273109436},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.21011647582054138},{"id":"https://openalex.org/keywords/data-consistency","display_name":"Data consistency","score":0.1852940022945404},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09424006938934326}],"concepts":[{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.7453809976577759},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6166887879371643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5946170091629028},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.589392364025116},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.5409458875656128},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5175020694732666},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5074533820152283},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3624088764190674},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3619532585144043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3571244478225708},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34731656312942505},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3376730680465698},{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.2787824273109436},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.21011647582054138},{"id":"https://openalex.org/C93361087","wikidata":"https://www.wikidata.org/wiki/Q4426698","display_name":"Data consistency","level":2,"score":0.1852940022945404},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09424006938934326},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3485541","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3485541","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3485541","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:arXiv.org:2011.11763","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2011.11763","pdf_url":"https://arxiv.org/pdf/2011.11763","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire/ab00bd17-c839-481d-a1b7-ab1b6ad50d0e","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/ab00bd17-c839-481d-a1b7-ab1b6ad50d0e","pdf_url":"https://pure.au.dk/ws/files/285313867/3485541.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":"Bui, T L, Chatterjee, K, Gautam, T, Pavlogiannis, A & Toman, V 2021, 'The reads-from equivalence for the TSO and PSO memory models', Proceedings of the ACM on Programming Languages , vol. 5, no. OOPSLA, 164. https://doi.org/10.1145/3485541","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:3108322019","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2011.11763.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.atira.dk:publications/ab00bd17-c839-481d-a1b7-ab1b6ad50d0e","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85117585070&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bui, T L, Chatterjee, K, Gautam, T, Pavlogiannis, A & Toman, V 2021, 'The reads-from equivalence for the TSO and PSO memory models', Proceedings of the ACM on Programming Languages , vol. 5, no. OOPSLA, 164. https://doi.org/10.1145/3485541","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.2011.11763","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2011.11763","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"doi:10.1145/3485541","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3485541","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3485541","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":[],"awards":[{"id":"https://openalex.org/G2554063606","display_name":"Efficient Algorithms for Computer Aided Verification","funder_award_id":"ICT15-003","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G5427933786","display_name":null,"funder_award_id":"863818","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3108322019.pdf","grobid_xml":"https://content.openalex.org/works/W3108322019.grobid-xml"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W137192327","https://openalex.org/W149053240","https://openalex.org/W1525350307","https://openalex.org/W1528441743","https://openalex.org/W1549714654","https://openalex.org/W1568729458","https://openalex.org/W1719093023","https://openalex.org/W1913137593","https://openalex.org/W1983206712","https://openalex.org/W1986463648","https://openalex.org/W1990838770","https://openalex.org/W1999288406","https://openalex.org/W2024875714","https://openalex.org/W2029601347","https://openalex.org/W2036316394","https://openalex.org/W2039509099","https://openalex.org/W2051016152","https://openalex.org/W2054739713","https://openalex.org/W2065675749","https://openalex.org/W2080658418","https://openalex.org/W2085773946","https://openalex.org/W2092955140","https://openalex.org/W2093088761","https://openalex.org/W2093709900","https://openalex.org/W2101939036","https://openalex.org/W2104932676","https://openalex.org/W2120476011","https://openalex.org/W2130190334","https://openalex.org/W2135355961","https://openalex.org/W2166422778","https://openalex.org/W2169870841","https://openalex.org/W2528919074","https://openalex.org/W2606910946","https://openalex.org/W2613199143","https://openalex.org/W2626631502","https://openalex.org/W2732850221","https://openalex.org/W2734336505","https://openalex.org/W2778029444","https://openalex.org/W2778798134","https://openalex.org/W2883559598","https://openalex.org/W2884767181","https://openalex.org/W2887814217","https://openalex.org/W2898988288","https://openalex.org/W2951734910","https://openalex.org/W2953899265","https://openalex.org/W2960913870","https://openalex.org/W2964156448","https://openalex.org/W2979942385","https://openalex.org/W2980138239","https://openalex.org/W2980176182","https://openalex.org/W2995880861","https://openalex.org/W3009455989","https://openalex.org/W3010429320","https://openalex.org/W3011074696","https://openalex.org/W3015867278","https://openalex.org/W3032865144","https://openalex.org/W3092639686","https://openalex.org/W3106314272","https://openalex.org/W3114146851","https://openalex.org/W3117594589","https://openalex.org/W3122287721","https://openalex.org/W4236306709","https://openalex.org/W4243889443"],"related_works":["https://openalex.org/W3159302701","https://openalex.org/W2725465810","https://openalex.org/W3201138908","https://openalex.org/W1561096265","https://openalex.org/W1523688497","https://openalex.org/W3102883299","https://openalex.org/W1839466040","https://openalex.org/W2773366521","https://openalex.org/W2174014146","https://openalex.org/W2086337948","https://openalex.org/W2006691103","https://openalex.org/W2082441208","https://openalex.org/W2182389258","https://openalex.org/W3204149473","https://openalex.org/W2474795766","https://openalex.org/W2181375233","https://openalex.org/W2886779068","https://openalex.org/W2100980249","https://openalex.org/W2787748416","https://openalex.org/W2028158226"],"abstract_inverted_index":{"The":[0,207],"verification":[1,26,33,126],"of":[2,27,91,101,124,146,223,255],"concurrent":[3,28,46],"programs":[4],"remains":[5],"an":[6,144,195],"open":[7],"challenge":[8,22],"due":[9],"to":[10,39,51,66,75,190,219],"the":[11,24,41,60,70,87,98,103,121,128,204,213,224,246,285,293,305],"non-determinism":[12],"in":[13,20,212,245,304],"inter-process":[14],"communication.":[15],"One":[16],"recurring":[17],"algorithmic":[18,99,122],"problem":[19,100,123],"this":[21,117],"is":[23,209,217,237,288],"consistency":[25,32,125],"executions.":[29],"In":[30,116],"particular,":[31],"under":[34,81,198],"a":[35,135,252,301],"reads-from":[36,42,136],"map":[37],"allows":[38],"compute":[40],"(RF)":[43],"equivalence":[44,62],"between":[45],"traces,":[47],"with":[48],"direct":[49],"applications":[50],"areas":[52],"such":[53],"as":[54,106,108,161,168],"Stateless":[55],"Model":[56],"Checking":[57],"(SMC).":[58],"Importantly,":[59],"RF":[61,104,205,225,286],"was":[63],"recently":[64],"shown":[65],"be":[67],"coarser":[68,291],"than":[69,292],"standard":[71,278,294],"Mazurkiewicz":[72],"equivalence,":[73,105],"leading":[74],"impressive":[76],"scalability":[77,275],"improvements":[78,276],"for":[79,86,127,165,183,269,283,297],"SMC":[80,196,247],"SC":[82],"(sequential":[83],"consistency).":[84],"However,":[85],"relaxed":[88],"memory":[89,132],"models":[90,133],"TSO":[92,129,166,199],"and":[93,130,140,152,167,200,229,250,271],"PSO":[94,131,201],"(total/partial":[95],"store":[96],"order),":[97],"deciding":[102],"well":[107],"its":[109],"impact":[110],"on":[111,187],"SMC,":[112,284],"has":[113],"been":[114],"elusive.":[115],"work":[118],"we":[119,155,193,240],"solve":[120],"given":[134],"map,":[137],"denoted":[138],"VTSO-rf":[139,270],"VPSO-rf,":[141],"respectively.":[142],"For":[143],"execution":[145],"n":[147,162,169,174],"events":[148],"over":[149,257,277],"k":[150,163,170,175,179,236],"threads":[151],"d":[153,181],"variables,":[154],"establish":[156],"novel":[157],"bounds":[158],"that":[159,202,215,266],"scale":[160],"+1":[164,171],"\u00b7":[172,180],"min(":[173],"2":[176,178],",":[177,211],")":[182],"PSO.":[184],"Moreover,":[185,280],"based":[186],"our":[188,243,267],"solution":[189],"these":[191],"problems,":[192],"develop":[194],"algorithm":[197,208],"uses":[203],"equivalence.":[206],"exploration-optimal":[210],"sense":[214],"it":[216],"guaranteed":[218],"explore":[220],"each":[221],"class":[222,234],"partitioning":[226,287,296],"exactly":[227],"once,":[228],"spends":[230],"polynomial":[231],"time":[232],"per":[233],"when":[235,281],"bounded.":[238],"Finally,":[239],"implement":[241],"all":[242],"algorithms":[244,268],"tool":[248],"Nidhugg,":[249],"perform":[251],"large":[253],"number":[254],"experiments":[256],"benchmarks":[258],"from":[259],"existing":[260],"literature.":[261],"Our":[262],"experimental":[263],"results":[264],"show":[265],"VPSO-rf":[272],"provide":[273],"significant":[274,302],"alternatives.":[279],"used":[282],"often":[289],"much":[290],"Shasha-Snir":[295],"TSO/PSO,":[298],"which":[299],"yields":[300],"speedup":[303],"model":[306],"checking":[307],"task.":[308]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}