{"id":"https://openalex.org/W2534587298","doi":"https://doi.org/10.1145/2983990.2984025","title":"Maximal causality reduction for TSO and PSO","display_name":"Maximal causality reduction for TSO and PSO","publication_year":2016,"publication_date":"2016-10-19","ids":{"openalex":"https://openalex.org/W2534587298","doi":"https://doi.org/10.1145/2983990.2984025","mag":"2534587298"},"language":"en","primary_location":{"id":"doi:10.1145/2983990.2984025","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2983990.2984025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004337874","display_name":"Shiyou Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shiyou Huang","raw_affiliation_strings":["Texas A&M University, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103035835","display_name":"Jeff Huang","orcid":"https://orcid.org/0000-0003-1393-0752"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeff Huang","raw_affiliation_strings":["Texas A&M University, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004337874"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":7.7204,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.9796819,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"447","last_page":"461"},"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.9998000264167786,"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.9998000264167786,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9995999932289124,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/partial-order-reduction","display_name":"Partial order reduction","score":0.8613958358764648},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8212767839431763},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.635575532913208},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5696151256561279},{"id":"https://openalex.org/keywords/sequential-consistency","display_name":"Sequential consistency","score":0.5598933696746826},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5295946002006531},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4495762288570404},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.43871310353279114},{"id":"https://openalex.org/keywords/consistency-model","display_name":"Consistency model","score":0.41984423995018005},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35805532336235046},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.1687518060207367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11208465695381165}],"concepts":[{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.8613958358764648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8212767839431763},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.635575532913208},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5696151256561279},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.5598933696746826},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5295946002006531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4495762288570404},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.43871310353279114},{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.41984423995018005},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35805532336235046},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.1687518060207367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11208465695381165},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2983990.2984025","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2983990.2984025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W68069235","https://openalex.org/W123460966","https://openalex.org/W1508401732","https://openalex.org/W1525350307","https://openalex.org/W1556323883","https://openalex.org/W1568729458","https://openalex.org/W1719093023","https://openalex.org/W1887412317","https://openalex.org/W1893845610","https://openalex.org/W1953680156","https://openalex.org/W1971332773","https://openalex.org/W1977768344","https://openalex.org/W1990838770","https://openalex.org/W1996009176","https://openalex.org/W2008078972","https://openalex.org/W2024875714","https://openalex.org/W2029601347","https://openalex.org/W2036316394","https://openalex.org/W2046368282","https://openalex.org/W2051016152","https://openalex.org/W2054739713","https://openalex.org/W2065675749","https://openalex.org/W2091085450","https://openalex.org/W2093709900","https://openalex.org/W2097465082","https://openalex.org/W2098643127","https://openalex.org/W2105980774","https://openalex.org/W2110852599","https://openalex.org/W2133697637","https://openalex.org/W2142297249","https://openalex.org/W2160781056","https://openalex.org/W2169870841","https://openalex.org/W2172078515","https://openalex.org/W2583970767","https://openalex.org/W2799644178","https://openalex.org/W2913459036","https://openalex.org/W4254906220","https://openalex.org/W6684644128","https://openalex.org/W6758810558"],"related_works":["https://openalex.org/W1868864221","https://openalex.org/W2970425440","https://openalex.org/W2397320769","https://openalex.org/W3147623613","https://openalex.org/W206281402","https://openalex.org/W1547793878","https://openalex.org/W2039509099","https://openalex.org/W4307886755","https://openalex.org/W2534587298","https://openalex.org/W3010429320"],"abstract_inverted_index":{"Verifying":[0],"concurrent":[1],"programs":[2],"is":[3,15,191],"challenging":[4],"due":[5],"to":[6,52,87,153],"the":[7,35,62,68,108,142,196,219],"exponentially":[8],"large":[9],"thread":[10],"interleaving":[11,36],"space.":[12],"The":[13],"problem":[14],"exacerbated":[16],"by":[17,38,56,89,106,132],"relaxed":[18],"memory":[19,72],"models":[20],"such":[21],"as":[22],"Total":[23],"Store":[24,29],"Order":[25,30,170],"(TSO)":[26],"and":[27,78,96,113,119,125,129,157,176,178,203,214],"Partial":[28,169],"(PSO)":[31],"which":[32],"further":[33],"explode":[34],"space":[37],"reordering":[39],"instructions.":[40],"A":[41],"recent":[42,167],"advance,":[43],"Maximal":[44],"Causality":[45],"Reduction":[46,171],"(MCR),":[47],"has":[48],"shown":[49],"great":[50],"promise":[51],"improve":[53],"verification":[54],"effectiveness":[55],"maximally":[57],"reducing":[58],"redundant":[59],"explorations.":[60],"However,":[61],"original":[63],"MCR":[64,88,152],"only":[65],"works":[66],"for":[67,76,174,199],"Sequential":[69],"Consistency":[70],"(SC)":[71],"model,":[73],"but":[74],"not":[75],"TSO":[77,95,112,128,156,175],"PSO.":[79],"In":[80],"this":[81],"paper,":[82],"we":[83],"develop":[84],"novel":[85,134],"extensions":[86],"solving":[90,120],"two":[91],"key":[92],"problems":[93],"under":[94],"PSO:":[97],"1)":[98],"generating":[99],"interleavings":[100,131],"that":[101,137,147,188,218],"can":[102],"reach":[103],"new":[104],"states":[105],"encoding":[107],"operational":[109],"semantics":[110],"of":[111,141],"PSO":[114,130,158,177],"with":[115,122,165],"first-order":[116],"logical":[117],"constraints":[118],"them":[121],"SMT":[123],"solvers,":[124],"2)":[126],"enforcing":[127],"developing":[133],"replay":[135],"algorithms":[136],"allow":[138],"executions":[139,213],"out":[140],"program":[143],"order.":[144],"We":[145,160],"show":[146,187],"our":[148,163,189],"approach":[149,164,190],"successfully":[150],"enables":[151],"effectively":[154],"explore":[155],"interleavings.":[159],"have":[161],"compared":[162],"a":[166,179],"Dynamic":[168],"(DPOR)":[172],"algorithm":[173],"SAT-based":[180],"stateless":[181],"model":[182],"checking":[183],"approach.":[184],"Our":[185],"results":[186],"much":[192],"more":[193],"effective":[194],"than":[195],"other":[197,220],"approaches":[198],"both":[200],"state-space":[201],"exploration":[202],"bug":[204],"finding":[205],"\u2013":[206],"on":[207],"average":[208],"it":[209],"explores":[210],"5-10X":[211],"fewer":[212],"finds":[215],"many":[216],"bugs":[217],"tools":[221],"cannot":[222],"find.":[223]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}