{"id":"https://openalex.org/W3021109941","doi":"https://doi.org/10.1145/3373718.3394783","title":"The Complexity of Dynamic Data Race Prediction","display_name":"The Complexity of Dynamic Data Race Prediction","publication_year":2020,"publication_date":"2020-05-26","ids":{"openalex":"https://openalex.org/W3021109941","doi":"https://doi.org/10.1145/3373718.3394783","mag":"3021109941"},"language":"en","primary_location":{"id":"doi:10.1145/3373718.3394783","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3373718.3394783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2004.14931","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016958234","display_name":"Umang Mathur","orcid":"https://orcid.org/0000-0002-7610-0660"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Umang Mathur","raw_affiliation_strings":["University of Illinois, Urbana, Champaign, USA","University of Illinois, Urbana-Champaign , USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana, Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois, Urbana-Champaign , USA","institution_ids":["https://openalex.org/I157725225"]}]},{"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;"],"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/A5076852218","display_name":"Mahesh Viswanathan","orcid":"https://orcid.org/0000-0001-7977-0080"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahesh Viswanathan","raw_affiliation_strings":["University of Illinois, Urbana, Champaign, USA","University of Illinois, Urbana-Champaign , USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana, Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois, Urbana-Champaign , USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016958234"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.2357,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46411955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"713","last_page":"727"},"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/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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976999759674072,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7618317604064941},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6183646321296692},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6117582321166992},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6110905408859253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5096273422241211},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48487553000450134},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4224073886871338},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4026148319244385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3662928342819214},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36077404022216797},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.14083412289619446}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7618317604064941},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6183646321296692},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6117582321166992},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6110905408859253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5096273422241211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48487553000450134},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4224073886871338},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4026148319244385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3662928342819214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36077404022216797},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.14083412289619446},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3373718.3394783","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3373718.3394783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2004.14931","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.14931","pdf_url":"https://arxiv.org/pdf/2004.14931","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":"text"},{"id":"mag:3021109941","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2004.14931.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/550f03df-8a22-4794-9938-7fdefc470443","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/550f03df-8a22-4794-9938-7fdefc470443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathur, U, Pavlogiannis, A & Viswanathan, M 2020, The Complexity of Dynamic Data Race Prediction. in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020., 3394783, Association for Computing Machinery, New York, pp. 713\u2013727, 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020, Saarbrucken, Germany, 08/07/2020. https://doi.org/10.1145/3373718.3394783","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.2004.14931","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2004.14931","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"},{"id":"doi:10.5446/49318","is_oa":true,"landing_page_url":"https://doi.org/10.5446/49318","pdf_url":null,"source":{"id":"https://openalex.org/S7407052952","display_name":"TIB KMO / FLOWWORKS GmbH","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2004.14931","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.14931","pdf_url":"https://arxiv.org/pdf/2004.14931","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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5214072062","display_name":null,"funder_award_id":"1901069","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3021109941.pdf","grobid_xml":"https://content.openalex.org/works/W3021109941.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W32942804","https://openalex.org/W1522334395","https://openalex.org/W1534988187","https://openalex.org/W1562462425","https://openalex.org/W1579452275","https://openalex.org/W1652742168","https://openalex.org/W1965367600","https://openalex.org/W1967736886","https://openalex.org/W1972544179","https://openalex.org/W1986463648","https://openalex.org/W2010699490","https://openalex.org/W2023304911","https://openalex.org/W2025819261","https://openalex.org/W2034256728","https://openalex.org/W2039509099","https://openalex.org/W2045238089","https://openalex.org/W2046368282","https://openalex.org/W2072419942","https://openalex.org/W2074937108","https://openalex.org/W2084732238","https://openalex.org/W2093755302","https://openalex.org/W2101939036","https://openalex.org/W2103408719","https://openalex.org/W2110920860","https://openalex.org/W2120476011","https://openalex.org/W2130190334","https://openalex.org/W2133662847","https://openalex.org/W2135023759","https://openalex.org/W2167744164","https://openalex.org/W2405985696","https://openalex.org/W2528919074","https://openalex.org/W2606910946","https://openalex.org/W2780745892","https://openalex.org/W2799137521","https://openalex.org/W2887512784","https://openalex.org/W2898988288","https://openalex.org/W2912084748","https://openalex.org/W2928577142","https://openalex.org/W2979942385","https://openalex.org/W2980176182","https://openalex.org/W2995880861","https://openalex.org/W3085225935","https://openalex.org/W3091178001","https://openalex.org/W3137220996","https://openalex.org/W4236306709","https://openalex.org/W4292230561","https://openalex.org/W4300810260"],"related_works":["https://openalex.org/W3032865144","https://openalex.org/W3182871384","https://openalex.org/W2174163014","https://openalex.org/W1910084381","https://openalex.org/W2010951658","https://openalex.org/W2010898533","https://openalex.org/W1482386282","https://openalex.org/W886683925","https://openalex.org/W3194308068","https://openalex.org/W1861862848","https://openalex.org/W2746574808","https://openalex.org/W3099303552","https://openalex.org/W2963930234","https://openalex.org/W2416947020","https://openalex.org/W1985058615","https://openalex.org/W2946505597","https://openalex.org/W2059543065","https://openalex.org/W2951958189","https://openalex.org/W40658589","https://openalex.org/W2903774916"],"abstract_inverted_index":{"Writing":[0],"concurrent":[1],"programs":[2],"is":[3,33,50,100],"notoriously":[4],"hard":[5],"due":[6],"to":[7,21,51,58],"scheduling":[8],"non-determinism.":[9],"The":[10],"most":[11,35],"common":[12],"concurrency":[13],"bugs":[14],"are":[15,19,116],"data":[16,40],"races,":[17],"which":[18,97],"accesses":[20],"a":[22,59,64,104],"shared":[23],"resource":[24],"that":[25,62],"can":[26,55],"be":[27,56],"executed":[28],"concurrently.":[29],"Dynamic":[30],"data-race":[31],"prediction":[32],"the":[34,48,67,98],"standard":[36],"technique":[37],"for":[38,74],"detecting":[39],"races:":[41],"given":[42],"an":[43],"observed,":[44],"data-race-free":[45],"trace":[46,60,105],"t,":[47],"task":[49],"determine":[52],"whether":[53],"t":[54,106],"reordered":[57],"t*":[61],"exposes":[63],"data-race.":[65],"Although":[66],"problem":[68,99],"has":[69,80],"received":[70],"significant":[71],"practical":[72],"attention":[73],"over":[75,110],"three":[76],"decades,":[77],"its":[78],"complexity":[79],"remained":[81],"elusive.":[82],"In":[83],"this":[84,88],"work,":[85],"we":[86],"address":[87],"lacuna,":[89],"identifying":[90],"sources":[91],"of":[92,107],"intractability":[93],"and":[94],"conditions":[95],"under":[96],"efficiently":[101],"solvable.":[102],"Given":[103],"size":[108],"n":[109],"k":[111],"threads,":[112],"our":[113],"main":[114],"results":[115],"as":[117],"follows.":[118]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}