{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T03:03:11Z","timestamp":1730343791376,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.23919\/fmcad.2019.8894270","type":"proceedings-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T09:25:06Z","timestamp":1573637106000},"page":"55-63","source":"Crossref","is-referenced-by-count":0,"title":["Proving Data Race Freedom in Task Parallel Programs Using a Weaker Partial Order"],"prefix":"10.23919","author":[{"given":"Benjamin","family":"Ogles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Aldous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Mercer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950329"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178514"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022920129859"},{"key":"ref30","first-page":"83","article-title":"Provably good and practically efficient parallel race detection for forkjoin programs","author":"utterback","year":"2016","journal-title":"Proceedings of the ACM Symposium on Parallel Algorithms and Architectures"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96983-1_5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2012.81"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2737975"},{"key":"ref12","first-page":"337","article-title":"Patrick O’Neil Meredith, and Grigore Rosu","volume":"49","year":"2014","journal-title":"Maximal sound predictive race detection with control flow abstraction SIGPLAN Not"},{"key":"ref13","first-page":"462","volume":"51","author":"huang","year":"2016","journal-title":"Precise and maximal race detection from incomplete traces SIGPLAN Not"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1145\/3022671.2984025","volume":"51","author":"huang","year":"2016","journal-title":"Maximal causality reduction for tso and pso In ACM SIGPLAN Notices"},{"key":"ref15","article-title":"Tardis: Task-level access race detection by intersecting sets","author":"ji","year":"2013","journal-title":"The 2nd Workshop on Determinism and Correctness in Parallel Programming (WODET11)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90054-J"},{"key":"ref17","first-page":"157","volume":"52","author":"kini","year":"2017","journal-title":"Dynamic race prediction in linear time SIGPLAN Not"},{"key":"ref18","first-page":"558","volume":"21","author":"lamport","year":"1978","journal-title":"Time clocks and the ordering of events in a distributed system Commun ACM"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3018610.3018611"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46982-9_23"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3158119"},{"key":"ref27","first-page":"110","article-title":"Dynamic race detection with llvm compiler","author":"serebryany","year":"2011","journal-title":"International Conference on Runtime Verification"},{"journal-title":"Habanerojava The new adventures of old x10","year":"2011","author":"cav\u00e9","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277696"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295732"},{"key":"ref5","first-page":"240","article-title":"Parametric and sliced causality","year":"2007","journal-title":"International Conference on Computer Aided Verification"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542490"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000120"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535845"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"journal-title":"Habanero-Java - Habanero - Rice University campus wiki","year":"0","key":"ref1"},{"key":"ref20","first-page":"145:1","article-title":"What happensafter the first race? enhancing the predictive power of happensbefore based dynamic race detection","author":"mathur","year":"2018","journal-title":"Proc ACM Program Lang"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77935-5_25"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125861"},{"journal-title":"Andreas Pavlogiannis Fast sound and effectively complete dynamic race detection CoRR","year":"2019","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2557833.2560581"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192385"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-642-16612-9_28","article-title":"Efficient data race detection for async-finish parallelism","author":"raman","year":"2010","journal-title":"International Conference on Runtime Verification"}],"event":{"name":"2019 Formal Methods in Computer Aided Design (FMCAD)","start":{"date-parts":[[2019,10,22]]},"location":"San Jose, CA, USA","end":{"date-parts":[[2019,10,25]]}},"container-title":["2019 Formal Methods in Computer Aided Design (FMCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8891869\/8894241\/08894270.pdf?arnumber=8894270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:45:46Z","timestamp":1598222746000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8894270\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":34,"URL":"https:\/\/doi.org\/10.23919\/fmcad.2019.8894270","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}