{"id":"https://openalex.org/W2986865434","doi":"https://doi.org/10.23919/fmcad.2019.8894270","title":"Proving Data Race Freedom in Task Parallel Programs Using a Weaker Partial Order","display_name":"Proving Data Race Freedom in Task Parallel Programs Using a Weaker Partial Order","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2986865434","doi":"https://doi.org/10.23919/fmcad.2019.8894270","mag":"2986865434"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2019.8894270","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2019.8894270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Formal Methods in Computer Aided Design (FMCAD)","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/A5045281710","display_name":"Benjamin M. Ogles","orcid":"https://orcid.org/0000-0003-4955-332X"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Ogles","raw_affiliation_strings":["Brigham Young University, Provo, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085993502","display_name":"Peter Aldous","orcid":"https://orcid.org/0000-0003-0602-2000"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Aldous","raw_affiliation_strings":["Brigham Young University, Provo, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005072374","display_name":"Eric Mercer","orcid":"https://orcid.org/0000-0002-2264-2958"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Mercer","raw_affiliation_strings":["Brigham Young University, Provo, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15057044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"55","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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.9991999864578247,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8050711154937744},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.6308916807174683},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5940966606140137},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.560093343257904},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.5028201937675476},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.45667076110839844},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4532625675201416},{"id":"https://openalex.org/keywords/race","display_name":"Race (biology)","score":0.42959412932395935},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.388619601726532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13563528656959534},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.123236745595932},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10668691992759705}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8050711154937744},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.6308916807174683},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5940966606140137},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.560093343257904},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.5028201937675476},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.45667076110839844},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4532625675201416},{"id":"https://openalex.org/C76509639","wikidata":"https://www.wikidata.org/wiki/Q918036","display_name":"Race (biology)","level":2,"score":0.42959412932395935},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.388619601726532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13563528656959534},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.123236745595932},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10668691992759705},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/fmcad.2019.8894270","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2019.8894270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8399999737739563,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1478599539","https://openalex.org/W1577551647","https://openalex.org/W1579452275","https://openalex.org/W1995085071","https://openalex.org/W2008078972","https://openalex.org/W2046368282","https://openalex.org/W2051016152","https://openalex.org/W2066952803","https://openalex.org/W2069072422","https://openalex.org/W2086147982","https://openalex.org/W2110592167","https://openalex.org/W2114647187","https://openalex.org/W2167744164","https://openalex.org/W2169870841","https://openalex.org/W2170200862","https://openalex.org/W2171480813","https://openalex.org/W2470978318","https://openalex.org/W2523223668","https://openalex.org/W2528919074","https://openalex.org/W2534587298","https://openalex.org/W2536074297","https://openalex.org/W2547439180","https://openalex.org/W2560856221","https://openalex.org/W2606910946","https://openalex.org/W2788308668","https://openalex.org/W2794006633","https://openalex.org/W2799137521","https://openalex.org/W2885377687","https://openalex.org/W2887512784","https://openalex.org/W2906726523","https://openalex.org/W2995880861","https://openalex.org/W3010429320","https://openalex.org/W3099303552","https://openalex.org/W3101794866","https://openalex.org/W3137220996","https://openalex.org/W4238388226","https://openalex.org/W4247215443","https://openalex.org/W6628822775","https://openalex.org/W6676600046","https://openalex.org/W6720228197","https://openalex.org/W6754089954"],"related_works":["https://openalex.org/W4234874385","https://openalex.org/W3013012681","https://openalex.org/W2323648130","https://openalex.org/W2337668750","https://openalex.org/W2492471733","https://openalex.org/W2157140558","https://openalex.org/W2094344997","https://openalex.org/W2109925752","https://openalex.org/W2349728712","https://openalex.org/W2980438719"],"abstract_inverted_index":{"Task":[0],"parallel":[1,12,27,134],"programming":[2,135],"models":[3],"such":[4],"as":[5],"Habanero":[6,186],"Java":[7,162,187],"help":[8],"developers":[9],"write":[10],"idiomatic":[11],"programs":[13,28],"and":[14,204],"avoid":[15],"common":[16],"errors.":[17],"Data":[18],"race":[19,79,112,143,183,196],"freedom":[20,184],"is":[21,30,70,119,127,149,201],"a":[22,82,120,153],"desirable":[23],"property":[24],"for":[25,77,130,194],"task":[26,133],"but":[29],"difficult":[31],"to":[32,109,151,180],"prove":[33,181],"because":[34],"every":[35],"possible":[36],"execution":[37,53],"of":[38,49,58,96,101,116,176],"the":[39,61,87,124,140,146,161,168,174,192,198],"program":[40,52,62,97],"must":[41],"be":[42,105,152],"considered.":[43],"A":[44,157],"partial":[45,74,85],"order":[46,75],"over":[47],"events":[48],"an":[50,55,71],"observed":[51],"induces":[54],"equivalence":[56,94],"class":[57],"executions":[59,103],"that":[60,123,139,167],"may":[63,104],"also":[64],"produce.":[65],"The":[66,114],"Does-not-Commute":[67],"(DC)":[68],"relation":[69,89,126,148,170,200],"efficiently":[72],"computable":[73],"used":[76,132],"data":[78,111,142,155,182,195],"detection.":[80],"As":[81],"relatively":[83,92],"weak":[84],"order,":[86],"DC":[88,125,147,169,199],"can":[90,171],"represent":[91],"large":[93],"classes":[95],"executions.":[98],"However,":[99],"some":[100],"these":[102],"infeasible,":[106],"thus":[107],"leading":[108],"false":[110],"reports.":[113],"contribution":[115],"this":[117,190],"paper":[118],"mechanized":[121],"proof":[122],"actually":[128],"sound":[129,203],"commonly":[131],"models.":[136],"Sound":[137],"means":[138],"first":[141],"identified":[144],"by":[145],"guaranteed":[150],"real":[154],"race.":[156],"prototype":[158],"analysis":[159],"in":[160,185],"Pathfinder":[163],"model":[164],"checker":[165],"shows":[166],"significantly":[172],"reduce":[173],"number":[175],"explored":[177],"states":[178],"required":[179],"programs.":[188],"In":[189],"application,":[191],"search":[193],"using":[197],"both":[202],"complete.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}