{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T05:12:03Z","timestamp":1788239523773,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T00:00:00Z","timestamp":1540512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1422798, 1329991"],"award-info":[{"award-number":["1422798, 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":[[2018,10,26]]},"DOI":"10.1145\/3236024.3236025","type":"proceedings-article","created":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T12:06:00Z","timestamp":1540814760000},"page":"26-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Data race detection on compressed traces"],"prefix":"10.1145","author":[{"given":"Dileep","family":"Kini","sequence":"first","affiliation":[{"name":"Akuna Capital, 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":[[2018,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"https:\/\/runtimeverification.com\/predict\/. Accessed: 2017-11-01","author":"Verification Runtime","year":"2017","unstructured":"2017. RV-Predict, Runtime Verification . https:\/\/runtimeverification.com\/predict\/. Accessed: 2017-11-01 . 2017 . Sequitur : Inferring Hierarchies From Sequences. http:\/\/www.sequitur.info\/. Accessed: 2017-08-01. 2018. RAPID : Dynamic Analysis for Concurrent Programs. https:\/\/github.com\/ umangm\/rapid. Accessed : July 30, 2018. 2018. ZipTrack: Race Detection on Compressed Traces . https:\/\/github.com\/ umangm\/ziptrack. Accessed : July 30, 2018. 2017. RV-Predict, Runtime Verification. https:\/\/runtimeverification.com\/predict\/. Accessed: 2017-11-01. 2017. Sequitur: Inferring Hierarchies From Sequences. http:\/\/www.sequitur.info\/. Accessed: 2017-08-01. 2018. RAPID: Dynamic Analysis for Concurrent Programs. https:\/\/github.com\/ umangm\/rapid. Accessed: July 30, 2018. 2018. ZipTrack: Race Detection on Compressed Traces. https:\/\/github.com\/ umangm\/ziptrack. Accessed: July 30, 2018."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119479.1119480"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(96)00014-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594323"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/582419.582440"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277696"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04921-2_23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250762"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945468"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635918"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the International Symposium on Parallel and Distributed Processing.","author":"Farchi E.","unstructured":"E. Farchi , Y. Nir , and S. Ur . 2003. Concurrent Bug Patterns and How to Test Them . In Proceedings of the International Symposium on Parallel and Distributed Processing. E. Farchi, Y. Nir, and S. Ur. 2003. Concurrent Bug Patterns and How to Test Them. In Proceedings of the International Symposium on Parallel and Distributed Processing."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science. 216\u2013226","author":"Feigenbaum J.","unstructured":"J. Feigenbaum , S. Kannan , M.Y. Vardi , and M. Viswanathan . 1998. Complexity of Problems on Graphs Represented as OBDDs . In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science. 216\u2013226 . J. Feigenbaum, S. Kannan, M.Y. Vardi, and M. Viswanathan. 1998. Complexity of Problems on Graphs Represented as OBDDs. In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science. 216\u2013226."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258493"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the Australian Computer Science Conference. 56\u201366","author":"Fidge C.J.","year":"1988","unstructured":"C.J. Fidge . 1988 . Timestamps in message-passing systems that preserve the partial ordering . In Proceedings of the Australian Computer Science Conference. 56\u201366 . C.J. Fidge. 1988. Timestamps in message-passing systems that preserve the partial ordering. In Proceedings of the Australian Computer Science Conference. 56\u201366."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349328"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806672.1806674"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375618"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80004-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594315"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984024"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/778553.778554"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.841160"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850665"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062374"},{"key":"e_1_3_2_1_27_1","volume-title":"Data Race Detection on Compressed Traces. CoRR abs\/1807.08427","author":"Kini Dileep","year":"2018","unstructured":"Dileep Kini , Umang Mathur , and Mahesh Viswanathan . 2018. Data Race Detection on Compressed Traces. CoRR abs\/1807.08427 ( 2018 ). http:\/\/arxiv.org\/abs\/1807. Dileep Kini, Umang Mathur, and Mahesh Viswanathan. 2018. Data Race Detection on Compressed Traces. CoRR abs\/1807.08427 (2018). http:\/\/arxiv.org\/abs\/1807."},{"key":"e_1_3_2_1_28_1","unstructured":"08427  08427"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSECOMPANION.2007.68"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892708"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2931037.2931046"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science. 277\u2013286","author":"Lozano A.","unstructured":"A. Lozano and J.L. Balc\u00e1zar . 1986. The complexity of graph problems for succinctly represented graphs . In Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science. 277\u2013286 . A. Lozano and J.L. Balc\u00e1zar. 1986. The complexity of graph problems for succinctly represented graphs. In Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science. 277\u2013286."},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the International Workshop on Parallel and Distributed Algorithms. 215\u2013226","author":"Mattern F.","year":"1988","unstructured":"F. Mattern . 1988 . Virtual time and Global states of distributed systems . In Proceedings of the International Workshop on Parallel and Distributed Algorithms. 215\u2013226 . F. Mattern. 1988. Virtual time and Global states of distributed systems. In Proceedings of the International Workshop on Parallel and Distributed Algorithms. 215\u2013226."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189756.1189758"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the USENIX Conference on Operating Systems Design and Implementation. 267\u2013280","author":"Musuvathi M.","unstructured":"M. Musuvathi , S. Qadeer , T. Ball , G. Basler , P.A. Nainar , and I. Neamtiu . 2008. Finding and Reproducing Heisenbugs in Concurrent Programs . In Proceedings of the USENIX Conference on Operating Systems Design and Implementation. 267\u2013280 . M. Musuvathi, S. Qadeer, T. Ball, G. Basler, P.A. Nainar, and I. Neamtiu. 2008. Finding and Reproducing Heisenbugs in Concurrent Programs. In Proceedings of the USENIX Conference on Operating Systems Design and Implementation. 267\u2013280."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622776.1622780"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80009-2"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781529"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890000"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504288"},{"key":"e_1_3_2_1_44_1","unstructured":"C. Ra  C. Ra"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254127"},{"key":"e_1_3_2_1_46_1","volume-title":"Proceedings of the International Conference on NASA Formal Methods. 313\u2013327","author":"Said M.","unstructured":"M. Said , C. Wang , Z. Yang , and K. Sakallah . 2011. Generating Data Race Witnesses by an SMT-based Analysis . In Proceedings of the International Conference on NASA Formal Methods. 313\u2013327 . M. Said, C. Wang, Z. Yang, and K. Sakallah. 2011. Generating Data Race Witnesses by an SMT-based Analysis. In Proceedings of the International Conference on NASA Formal Methods. 313\u2013327."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266641"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375584"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103702"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/582034.582042"},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the International Conference on Runtime Verification. 368\u2013385","author":"Surendran R.","year":"2018","unstructured":"R. Surendran and V. Sarkar . 2016. Dynamic determinacy race detection for task parallelism with futures . In Proceedings of the International Conference on Runtime Verification. 368\u2013385 . ESEC\/FSE \u201918, November 4 \u20139 , 2018 , Lake Buena Vista, FL, USA Dileep Kini, Umang Mathur, and Mahesh Viswanathan R. Surendran and V. Sarkar. 2016. Dynamic determinacy race detection for task parallelism with futures. In Proceedings of the International Conference on Runtime Verification. 368\u2013385. ESEC\/FSE \u201918, November 4\u20139, 2018, Lake Buena Vista, FL, USA Dileep Kini, Umang Mathur, and Mahesh Viswanathan"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/791229.792267"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287654"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05089-3_17"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1659158"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360206"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.841161"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950329"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950332"}],"event":{"name":"ESEC\/FSE '18: 26th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","location":"Lake Buena Vista FL USA","acronym":"ESEC\/FSE '18","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236024.3236025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3236024.3236025","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3236024.3236025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:25Z","timestamp":1750208245000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236024.3236025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,26]]},"references-count":58,"alternative-id":["10.1145\/3236024.3236025","10.1145\/3236024"],"URL":"https:\/\/doi.org\/10.1145\/3236024.3236025","relation":{},"subject":[],"published":{"date-parts":[[2018,10,26]]},"assertion":[{"value":"2018-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}