{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:19:21Z","timestamp":1784830761572,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Air Force Office of Scientific Research","award":["AFOSR FA9950-15-1-0059"],"award-info":[{"award-number":["AFOSR FA9950-15-1-0059"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF TWC 1314485, NSF CSR 1422798, NSF CPS 1329991,"],"award-info":[{"award-number":["NSF TWC 1314485, NSF CSR 1422798, NSF CPS 1329991,"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,14]]},"DOI":"10.1145\/3062341.3062374","type":"proceedings-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T10:01:04Z","timestamp":1497434464000},"page":"157-170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Dynamic race prediction in linear time"],"prefix":"10.1145","author":[{"given":"Dileep","family":"Kini","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Umang","family":"Mathur","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"https:\/\/publish.illinois.edu\/race-prediction\/.  https:\/\/publish.illinois.edu\/race-prediction\/."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119479.1119480"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167515.1167488"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809028.1806626"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/583854.582440"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368119"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277696"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645456.654536"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273442.1250762"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945468"},{"key":"e_1_3_2_2_11_1","first-page":"286","volume-title":"Proceedings of the 17th International Symposium on Parallel and Distributed Processing, IPDPS \u201903","author":"Farchi E.","unstructured":"E. Farchi , Y. Nir , and S. Ur . Concurrent Bug Patterns and How to Test Them . In Proceedings of the 17th International Symposium on Parallel and Distributed Processing, IPDPS \u201903 , pages 286 .2\u2013, Washington, DC, USA, 2003. IEEE Computer Society. E. Farchi, Y. Nir, and S. Ur. Concurrent Bug Patterns and How to Test Them. In Proceedings of the 17th International Symposium on Parallel and Distributed Processing, IPDPS \u201903, pages 286.2\u2013, Washington, DC, USA, 2003. IEEE Computer Society."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258493"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349328"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542490"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806672.1806674"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984024"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786840"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666356.2594315"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2818754.2818856"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522736"},{"key":"e_1_3_2_2_21_1","volume-title":"Dynamic Race Prediction in Linear Time. CoRR, abs\/1704.02432","author":"Kini D.","year":"2017","unstructured":"D. Kini , U. Mathur , and M. Viswanathan . Dynamic Race Prediction in Linear Time. CoRR, abs\/1704.02432 , 2017 . D. Kini, U. Mathur, and M. Viswanathan. Dynamic Race Prediction in Linear Time. CoRR, abs\/1704.02432, 2017."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSECOMPANION.2007.68"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2931037.2931046"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542491"},{"key":"e_1_3_2_2_26_1","volume-title":"North-Holland","author":"Mattern F.","year":"1988","unstructured":"F. Mattern . Virtual Time and Global States of Distributed Systems . In Parallel and Distributed Algorithms, pages 215\u2013 226 . North-Holland , 1988 . F. Mattern. Virtual Time and Global States of Distributed Systems. In Parallel and Distributed Algorithms, pages 215\u2013 226. North-Holland, 1988."},{"key":"e_1_3_2_2_27_1","first-page":"280","volume-title":"Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201908","author":"Musuvathi M.","year":"2008","unstructured":"M. Musuvathi , S. Qadeer , T. Ball , G. Basler , P. A. Nainar , and I. Neamtiu . Finding and Reproducing Heisenbugs in Concurrent Programs . In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201908 , pages 267\u2013 280 , Berkeley, CA, USA , 2008 . USENIX Association. M. Musuvathi, S. Qadeer, T. Ball, G. Basler, P. A. Nainar, and I. Neamtiu. Finding and Reproducing Heisenbugs in Concurrent Programs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201908, pages 267\u2013280, Berkeley, CA, USA, 2008. USENIX Association."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133255.1134018"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/966049.781528"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/966049.781529"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890000"},{"key":"e_1_3_2_2_32_1","unstructured":"C. Ra  C. Ra"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2345156.2254127"},{"key":"e_1_3_2_2_35_1","unstructured":"G. Rosu. RV-Predict Runtime Verification. https:\/\/ runtimeverification.com\/predict\/. Accessed: 2016- 11-15.  G. Rosu. RV-Predict Runtime Verification. https:\/\/ runtimeverification.com\/predict\/. Accessed: 2016- 11-15."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1986308.1986334"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/269005.266641"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375584"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11494881_14"},{"key":"e_1_3_2_2_40_1","first-page":"150","volume-title":"International Conference on Runtime Verification","author":"Serb\u0103nu\u00b8t\u0103 T. F.","unstructured":"T. F. \u00b8 Serb\u0103nu\u00b8t\u0103 , F. Chen , and G. Ro\u00b8su . Maximal causal models for sequentially consistent systems . In International Conference on Runtime Verification , pages 136\u2013 150 . Springer, 2012. T. F. \u00b8 Serb\u0103nu\u00b8t\u0103, F. Chen, and G. Ro\u00b8su. Maximal causal models for sequentially consistent systems. In International Conference on Runtime Verification, pages 136\u2013150. Springer, 2012."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1791194.1791203"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103621.2103702"},{"key":"e_1_3_2_2_43_1","volume-title":"Proceedings of the third workshop on Java for high performance computing","author":"Smith L. A.","year":"2001","unstructured":"L. A. Smith and J. M. Bull . A multithreaded java grande benchmark suite . In Proceedings of the third workshop on Java for high performance computing , 2001 . L. A. Smith and J. M. Bull. A multithreaded java grande benchmark suite. In Proceedings of the third workshop on Java for high performance computing, 2001."},{"key":"e_1_3_2_2_44_1","first-page":"385","volume-title":"International Conference on Runtime Verification","author":"Surendran R.","unstructured":"R. Surendran and V. Sarkar . Dynamic determinacy race detection for task parallelism with futures . In International Conference on Runtime Verification , pages 368\u2013 385 . Springer, 2016. R. Surendran and V. Sarkar. Dynamic determinacy race detection for task parallelism with futures. In International Conference on Runtime Verification, pages 368\u2013385. Springer, 2016."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/504311.504288"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287654"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05089-3_17"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/373243.360206"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950329"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095809.1095832"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950332"}],"event":{"name":"PLDI '17: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Barcelona Spain","acronym":"PLDI '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3062341.3062374","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3062341.3062374","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3062341.3062374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:36:32Z","timestamp":1750203392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3062341.3062374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":50,"alternative-id":["10.1145\/3062341.3062374","10.1145\/3062341"],"URL":"https:\/\/doi.org\/10.1145\/3062341.3062374","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3140587.3062374","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,6,14]]},"assertion":[{"value":"2017-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}