{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T05:12:04Z","timestamp":1788239524134,"version":"build-2803163510"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":3,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,6,10]]},"abstract":"<jats:p>\n                    Dynamic race detection based on the happens before (HB) partial order has now become the de facto approach to quickly identify data races in multi-threaded software. Most practical implementations for detecting these races use timestamps to infer causality between events and detect races based on these timestamps. Such an algorithm updates timestamps (stored in vector clocks) at every event in the execution, and is known to induce excessive overhead. Random sampling has emerged as a promising algorithmic paradigm to offset this overhead. It offers the promise of making sound race detection scalable. In this work we consider the task of designing an efficient sampling based race detector with low overhead for timestamping when the number of sampled events is much smaller than the total events in an execution. To solve this problem, we propose (1) a new notion of\n                    <jats:italic toggle=\"yes\">freshness timestamp<\/jats:italic>\n                    , (2) a new data structure to store timestamps, and (3) an algorithm that uses a combination of them to reduce the cost of timestamping in sampling based race detection. Further, we prove that our algorithm is close to optimal \u2014 the number of vector clock traversals is bounded by the number of sampled events and number of threads, and further, on any given dynamic execution, the cost of timestamping due to our algorithm is close to the amount of work any timestamping-based algorithm must perform on that execution, that is it is instance optimal. Our evaluation on real world benchmarks demonstrates the effectiveness of our proposed algorithm over prior timestamping algorithms that are agnostic to sampling.\n                  <\/jats:p>","DOI":"10.1145\/3729252","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T16:02:27Z","timestamp":1749830547000},"page":"150-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Timestamping for Sampling-Based Race Detection"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5017-2228","authenticated-orcid":false,"given":"Minjian","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5184-6339","authenticated-orcid":false,"given":"Daniel Wee Soong","family":"Lim","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6832-0604","authenticated-orcid":false,"given":"Mosaad","family":"Al Thokair","sequence":"additional","affiliation":[{"name":"Saudi Aramco, Dhahran, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7610-0660","authenticated-orcid":false,"given":"Umang","family":"Mathur","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7977-0080","authenticated-orcid":false,"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Martin Abadi Cormac Flanagan and Stephen N. Freund. 2006. Types for Safe Locking: Static Race Detection for Java. ACM Trans. Program. Lang. Syst. 28 2 (March 2006) 207-255.","DOI":"10.1145\/1119479.1119480"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Parosh Abdulla Stavros Aronis Bengt Jonsson and Konstantinos Sagonas2014. Optimal dynamic partial order reduction. ACM SIGPLAN Notices 49 1 (2014) 373-384.","DOI":"10.1145\/2578855.2535845"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","unstructured":"Parosh Abdulla Stavros Aronis Bengt Jonsson and Konstantinos Sagonas.2014. Optimal Dynamic Partial Order Reduction. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (San Diego California USA) (POPL '14). ACM New York NY USA 373-384. https:\/\/doi.org\/10.1145\/2535838.2535845 10.1145\/2535838.2535845","DOI":"10.1145\/2535838.2535845"},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Pratyush Agarwal Krishnendu Chatterjee Shreya Pathak Andreas Pavlogiannis and Viktor Toman. 2021. Stateless model checking under a reads-value-from equivalence. In International Conference on Computer Aided Verification. Springer 341-366.","DOI":"10.1007\/978-3-030-81685-8_16"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Zhendong Ang and Umang Mathur. 2024. Predictive Monitoring against Pattern Regular Languages. Proc. ACM Program. Lang. 8 POPL Article 73 (Jan. 2024) 35 pages. https:\/\/doi.org\/10.1145\/3632915 10.1145\/3632915","DOI":"10.1145\/3632915"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Zhendong Ang and Umang Mathur. 2024. Predictive Monitoring with Strong Trace Prefixes. In Computer Aided Verification Arie Gurfinkeland Vijay Ganesh (Eds.). Springer Nature Switzerland Cham 182-204.","DOI":"10.1007\/978-3-031-65630-9_9"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Swarnendu Biswas Man Cao Minjia Zhang Michael D. Bond and Benjamin P. Wood. 2017. Lightweight Data Race Detection for Production Runs. In Proceedings of the 26th International Conference on Compiler Construction (Austin TX USA) (CC 2017). Association for Computing Machinery New York NY USA 11-21. https:\/\/doi.org\/10.1145\/3033019.3033020 10.1145\/3033019.3033020","DOI":"10.1145\/3033019.3033020"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Sam Blackshear Nikos Gorogiannis Peter W. O'Hearn and Ilya Sergey. 2018. RacerD: Compositional Static Race Detection. Proc. ACM Program. Lang. 2 OOPSLA Article 144 (oct 2018) 28 pages. https:\/\/doi.org\/10.1145\/3276514 10.1145\/3276514","DOI":"10.1145\/3276514"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Hans-J. Boehm. 2012. Position Paper: Nondeterminism is Unavoidable but Data Races Are Pure Evil. In Proceedings of the 2012 ACM Workshop on Relaxing Synchronization for Multicore and Manycore Scalability (Tucson Arizona USA) (RACES '12). Association for Computing Machinery New York NY USA 9-14. https:\/\/doi.org\/10.1145\/2414729.2414732 10.1145\/2414729.2414732","DOI":"10.1145\/2414729.2414732"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Michael D. Bond Katherine E. Coons and Kathryn S. McKinley . 2010. PACER: Proportional Detection of Data Races. In Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (Toronto Ontario Canada) (PLDI '10). ACM New York NY USA 255-268. https:\/\/doi.org\/10.1145\/1806596.1806626 10.1145\/1806596.1806626","DOI":"10.1145\/1806596.1806626"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","unstructured":"Michael D. Bond Milind Kulkarni Man Cao Minjia Zhang Meisam Fathi Salmi Swarnendu Biswas Aritra Sengupta and Jipeng Huang. 2013. OCTET: Capturing and Controlling Cross-thread Dependences Efficiently. SIGPLAN Not. 48 10 (Oct. 2013) 693-712. https:\/\/doi.org\/10.1145\/2544173.2509519 10.1145\/2544173.2509519","DOI":"10.1145\/2544173.2509519"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","unstructured":"Sebastian Burckhardt Pravesh Kothari Madanlal Musuvathi and Santosh Nagarakatte. 2010. A Randomized Scheduler with Probabilistic Guarantees of Finding Bugs. In Proceedings of the Fifteenth International Conference on Architectural Support for Programming Languages and Operating Systems (Pittsburgh Pennsylvania USA) (ASPLOS XV). Association for Computing Machinery New York NY USA 167-178. https:\/\/doi.org\/10.1145\/1736020.1736040 10.1145\/1736020.1736040","DOI":"10.1145\/1736020.1736040"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","unstructured":"Jong-Deok Choi Keunwoo Lee Alexey Loginov Robert O\u2019Callahan Vivek Sarkar and Manu Sridharan. 2002. Efficient and Precise Datarace Detection for Multithreaded Object-oriented Programs. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (Berlin Germany) (PLDI '02). ACM New York NY USA 258-269. https:\/\/doi.org\/10.1145\/512529.512560 10.1145\/512529.512560","DOI":"10.1145\/512529.512560"},{"key":"e_1_3_2_15_2","unstructured":"Chromium Blog 2014. Testing Chromium: ThreadSanitizer v2 a next-gen data race detector. https:\/\/blog.chromium.org\/2014\/04\/testing-chromium-threadsanitizer-v2.html. Accessed: 2024-07-11."},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","unstructured":"Djellel Eddine Difallah Andrew Pavlo Carlo Curino and Philippe Cudr\u00e9-Mauroux. 2013. OLTP-Bench: An Extensible Testbed for Benchmarking Relational Databases. PVLDB 7 4 (2013) 277-288. http:\/\/www.vldb.org\/pvldb\/vol7\/p277difallah.pdf","DOI":"10.14778\/2732240.2732246"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Tayfun Elmas Shaz Qadeer and Serdar Tasiran. 2007. Goldilocks: A Race and Transaction-aware Java Runtime. In Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation (San Diego California USA) (PLDI '07). ACM New York NY USA 245-255. https:\/\/doi.org\/10.1145\/1250734.1250762 10.1145\/1250734.1250762","DOI":"10.1145\/1250734.1250762"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Dawson Engler and Ken Ashcraft. 2003. RacerX: Effective Static Detection of Race Conditions and Deadlocks. SIGOPS Oper. Syst. Rev. 37 5 (Oct. 2003) 237-252.","DOI":"10.1145\/1165389.945468"},{"key":"e_1_3_2_19_2","unstructured":"John Erickson Madanlal Musuvathi Sebastian Burckhardt and Kirk Olynyk. 2010. Effective Data-Race Detection for the Kernel. In Proceedings of the 9th USENIX Conference on Operating Systems Design and Implementation (Vancouver BC Canada) (OSDI'10). USENIX Association USA 151-162."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Azadeh Farzan and Umang Mathur. 2024. Coarser Equivalences for Causal Concurrency. Proc. ACM Program. Lang. 8 POPL Article 31 (Jan. 2024) 31 pages. https:\/\/doi.org\/10.1145\/3632873 10.1145\/3632873","DOI":"10.1145\/3632873"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","unstructured":"Colin Fidge. 1991. Logical Time in Distributed Computing Systems. Computer 24 8 (Aug. 1991) 28-33. https: \/\/doi.org\/10.1109\/2.84874 10.1109\/2.84874","DOI":"10.1109\/2.84874"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Cormac Flanagan and Stephen N. Freund. 2009. FastTrack: Efficient and Precise Dynamic Race Detection. In Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (Dublin Ireland) (PLDI '09). ACM New York NY USA 121-133. https:\/\/doi.org\/10.1145\/1542476.1542490 10.1145\/1542476.1542490","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Cormac Flanagan and Stephen N. Freund. 2013. RedCard: Redundant Check Elimination for Dynamic Race Detectors. In Proceedings of the 27th European Conference on Object-Oriented Programming (Montpellier France) (ECOOP'13). Springer-Verlag Berlin Heidelberg 255-280.","DOI":"10.1007\/978-3-642-39038-8_11"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Nikos Gorogiannis Peter W. O'Hearn and Ilya Sergey. 2019. A True Positives Theorem for a Static Race Detector. Proc. ACM Program. Lang. 3 POPL Article 57 (Jan. 2019) 29 pages. https:\/\/doi.org\/10.1145\/3290370 10.1145\/3290370","DOI":"10.1145\/3290370"},{"key":"e_1_3_2_25_2","unstructured":"Christian Holler Aria Beingessner and Kris Wright. 2021. Eliminating Data Races in Firefox \u2014 A Technical Report. https:\/\/hacks.mozilla.org\/2021\/04\/eliminating-data-races-in-firefox-a-technical-report\/. Accessed: 2022-07-11."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","unstructured":"Jeff Huang Patrick O\u2019Neil Meredith and Grigore Rosu. 2014. Maximal Sound Predictive Race Detection with Control Flow Abstraction. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (Edinburgh United Kingdom) (PLDI '14). ACM New York NY USA 337-348. https:\/\/doi.org\/10.1145\/2594291.2594315 10.1145\/2594291.2594315","DOI":"10.1145\/2594291.2594315"},{"key":"e_1_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Baris Kasikci Cristian Zamfir and George Candea. 2013. RaceMob: Crowdsourced Data Race Detection. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (Farminton Pennsylvania) (SOSP '13). ACM New York NY USA 406-422.","DOI":"10.1145\/2517349.2522736"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","unstructured":"Dileep Kini Umang Mathur and Mahesh Viswanathan. 2017. Dynamic Race Prediction in Linear Time. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (Barcelona Spain) (PLDI 2017). ACM New York NY USA 157-170. https:\/\/doi.org\/10.1145\/3062341.3062374 10.1145\/3062341.3062374","DOI":"10.1145\/3062341.3062374"},{"key":"e_1_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Michalis Kokologiannakis Iason Marmanis Vladimir Gladstein and Viktor Vafeiadis. 2022. Truly stateless optimal dynamic partial order reduction. Proceedings of the ACM on Programming Languages 6 POPL (2022) 1-28.","DOI":"10.1145\/3498711"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","unstructured":"Rucha Kulkarni Umang Mathur and Andreas Pavlogiannis. 2021. Dynamic Data-Race Detection Through the FineGrained Lens. In 32nd International Conference on Concurrency Theory (CONCUR 2021) (Leibniz International Proceedings in Informatics (LIPIcs) Vol. 203) Serge Haddadand Daniele Varacca (Eds.). Schloss Dagstuhl \u2014 Leibniz-Zentrum f\u00fcr Informatik Dagstuhl Germany 16:1-16:23. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.16 10.4230\/LIPIcs.CONCUR.2021.16","DOI":"10.4230\/LIPIcs.CONCUR.2021.16"},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Leslie Lamport. 1978. Time Clocks and the Ordering of Events in a Distributed System. Commun. ACM 21 7 (July 1978) 558-565.","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Chris Lattner and Vikram Adve. 2004. LLVM: A compilation framework for lifelong program analysis & transformation. In International symposium on code generation and optimization 2004. CGO 2004. IEEE 75-86.","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","unstructured":"Guangpu Li Shan Lu Madanlal Musuvathi Suman Nath and Rohan Padhye. 2019. Efficient scalable thread-safetyviolation detection: finding thousands of concurrency bugs during testing. In Proceedings of the 27th ACM Symposium on Operating Systems Principles (Huntsville Ontario Canada) (SOSP '19). Association for Computing Machinery New York NY USA 162-180. https:\/\/doi.org\/10.1145\/3341301.3359638 10.1145\/3341301.3359638","DOI":"10.1145\/3341301.3359638"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","unstructured":"Daniel Marino Madanlal Musuvathi and Satish Narayanasamy. 2009. LiteRace: Effective Sampling for Lightweight Data-race Detection. In Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (Dublin Ireland) (PLDI '09). ACM New York NY USA 134-143. https:\/\/doi.org\/10.1145\/1542476.1542491 10.1145\/1542476.1542491","DOI":"10.1145\/1542476.1542491"},{"key":"e_1_3_2_35_2","unstructured":"Umang Mathur. 2018. RAPID. https:\/\/github.com\/umangm\/rapid Accessed: 2024-07-01."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","unstructured":"Umang Mathur Dileep Kini and Mahesh Viswanathan. 2018. What Happens-after the First Race? Enhancing the Predictive Power of Happens-before Based Dynamic Race Detection. Proc. ACM Program. Lang. 2 OOPSLA Article 145 (Oct. 2018) 29 pages. https:\/\/doi.org\/10.1145\/3276515 10.1145\/3276515","DOI":"10.1145\/3276515"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","unstructured":"Umang Mathur Andreas Pavlogiannis H\u00fcnkar Can Tun\u00e7 and Mahesh Viswanathan. 2022. A Tree Clock Data Structure for Causal Orderings in Concurrent Executions. In Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (Lausanne Switzerland) (ASPLOS 2022). Association for Computing Machinery New York NY USA 710-725. https:\/\/doi.org\/10.1145\/3503222.3507734 10.1145\/3503222.3507734","DOI":"10.1145\/3503222.3507734"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","unstructured":"Umang Mathur Andreas Pavlogiannis and Mahesh Viswanathan. 2020. The Complexity of Dynamic Data Race Prediction. In Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science (Saarbr\u00fccken Germany) (LICS '20). Association for Computing Machinery New York NY USA 713-727. https:\/\/doi.org\/10.1145\/3373718.3394783 10.1145\/3373718.3394783","DOI":"10.1145\/3373718.3394783"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","unstructured":"Umang Mathur Andreas Pavlogiannis and Mahesh Viswanathan. 2021. Optimal Prediction of SynchronizationPreserving Races. Proc. ACM Program. Lang. 5 POPL Article 36 (jan 2021) 29 pages. https:\/\/doi.org\/10.1145\/3434317 10.1145\/3434317","DOI":"10.1145\/3434317"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","unstructured":"Umang Mathur and Mahesh Viswanathan. 2020. Atomicity Checking in Linear Time Using Vector Clocks. In Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (Lausanne Switzerland) (ASPLOS '20). Association for Computing Machinery New York NY USA 183-199. https:\/\/doi.org\/10.1145\/3373376.3378475 10.1145\/3373376.3378475","DOI":"10.1145\/3373376.3378475"},{"key":"e_1_3_2_41_2","unstructured":"Friedemann Mattern. 1988. Virtual Time and Global States of Distributed Systems. In Parallel and Distributed Algorithms. North-Holland 215-226."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","unstructured":"Arndt M\u00fcehlenfeld and Franz Wotawa. 2007. Fault Detection in Multi-threaded C++ Server Applications. In Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (San Jose California USA) (PPoPP '07). ACM New York NY USA 142-143. https:\/\/doi.org\/10.1145\/1229428.1229457 10.1145\/1229428.1229457","DOI":"10.1145\/1229428.1229457"},{"key":"e_1_3_2_43_2","unstructured":"Madanlal Musuvathi Shaz Qadeer Thomas Ball Gerard Basler Piramanayagam Arumuga Nainar and Iulian Neamtiu. 2008. Finding and Reproducing Heisenbugs in Concurrent Programs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (San Diego California) (OSDI'08). USENIX Association Berkeley CA USA 267-280."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","unstructured":"Nicholas Nethercote and Julian Seward. 2007. Valgrind: a framework for heavyweight dynamic binary instrumentation. In Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation (San Diego California USA) (PLDI '07). Association for Computing Machinery New York NY USA 89-100. https:\/\/doi.org\/10.1145\/1250734.1250746 10.1145\/1250734.1250746","DOI":"10.1145\/1250734.1250746"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","unstructured":"Andreas Pavlogiannis. 2019. Fast Sound and Effectively Complete Dynamic Race Prediction. Proc. ACM Program. Lang. 4 POPL Article 17 (Dec. 2019) 29 pages. https:\/\/doi.org\/10.1145\/3371085 10.1145\/3371085","DOI":"10.1145\/3371085"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","unstructured":"Eli Pozniansky and Assaf Schuster. 2003. Efficient On-the-fly Data Race Detection in Multithreaded C++ Programs. In Proceedings of the Ninth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (San Diego California USA) (PPoPP '03). ACM New York NY USA 179-190. https:\/\/doi.org\/10.1145\/781498.781529 10.1145\/781498.781529","DOI":"10.1145\/781498.781529"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","unstructured":"Dustin Rhodes Cormac Flanagan and Stephen N. Freund. 2017. BigFoot: Static Check Placement for Dynamic Race Detection. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (Barcelona Spain) (PLDI 2017). ACM New York NY USA 141-156. https:\/\/doi.org\/10.1145\/3062341.3062350 10.1145\/3062341.3062350","DOI":"10.1145\/3062341.3062350"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","unstructured":"Jake Roemer Kaan Gen\u00e7 and Michael D. Bond. 2018. High-coverage Unbounded Sound Predictive Race Detection. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation (Philadelphia PA USA) (PLDI 2018). ACM New York NY USA 374-389. https:\/\/doi.org\/10.1145\/3192366.3192385 10.1145\/3192366.3192385","DOI":"10.1145\/3192366.3192385"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","unstructured":"Jake Roemer Kaan Gen\u00e7 and Michael D. Bond. 2020. SmartTrack: Efficient Predictive Race Detection. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (London UK) (PLDI 2020). Association for Computing Machinery New York NY USA 747-762. https:\/\/doi.org\/10.1145\/3385412.3385993 10.1145\/3385412.3385993","DOI":"10.1145\/3385412.3385993"},{"key":"e_1_3_2_50_2","unstructured":"Grigore Rosu. 2018. RV-Predict Runtime Verification. Accessed: 2018-04-01."},{"key":"e_1_3_2_51_2","doi-asserted-by":"crossref","unstructured":"Mahmoud Said Chao Wang Zijiang Yang and Karem Sakallah. 2011. Generating Data Race Witnesses by an SMT-based Analysis. In Proceedings of the Third International Conference on NASA Formal Methods (Pasadena CA) (NFM'11). Springer-Verlag Berlin Heidelberg 313-327.","DOI":"10.1007\/978-3-642-20398-5_23"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","unstructured":"Stefan Savage Michael Burrows Greg Nelson Patrick Sobalvarro and Thomas Anderson. 1997. Eraser: A Dynamic Data Race Detector for Multithreaded Programs. ACM Trans. Comput. Syst. 15 4 (Nov. 1997) 391-411. https:\/\/doi.org\/10.1145\/265924.265927 10.1145\/265924.265927","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_53_2","doi-asserted-by":"crossref","unstructured":"Konstantin Serebryany and Timur Iskhodzhanov. 2009. ThreadSanitizer: Data Race Detection in Practice. In Proceedings of the Workshop on Binary Instrumentation and Applications (New York New York USA) (WBIA '09). ACM New York NY USA 62-71.","DOI":"10.1145\/1791194.1791203"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","unstructured":"Kostya Serebryany Chris Kennelly Mitch Phillips Matt Denton Marco Elver Alexander Potapenko Matt Morehouse Vlad Tsyrklevich Christian Holler Julian Lettner David Kilzer and Lander Brandt. 2024. GWP-ASan: Sampling-Based Detection of Memory-Safety Bugs in Production. In Proceedings of the 46th International Conference on Software Engineering: Software Engineering in Practice (Lisbon Portugal) (ICSE-SEIP '24). Association for Computing Machinery New York NY USA 168-177. https:\/\/doi.org\/10.1145\/3639477.3640328 10.1145\/3639477.3640328","DOI":"10.1145\/3639477.3640328"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","unstructured":"Zheng Shi Umang Mathur and Andreas Pavlogiannis. 2024. Optimistic Prediction of Synchronization-Reversal Data Races. In Proceedings of the IEEE\/ACM 46th International Conference on Software Engineering (Lisbon Portugal) (ICSE '24). Association for Computing Machinery New York NY USA Article 134 13 pages. https:\/\/doi.org\/10.1145\/3597503.3639099 10.1145\/3597503.3639099","DOI":"10.1145\/3597503.3639099"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","unstructured":"Yannis Smaragdakis Jacob Evans Caitlin Sadowski Jaeheon Yi and Cormac Flanagan. 2012. Sound Predictive Race Detection in Polynomial Time. In Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Philadelphia PA USA) (POPL '12). ACM New York NY USA 387-400. https:\/\/doi.org\/10.1145\/2103656.2103702 10.1145\/2103656.2103702","DOI":"10.1145\/2103656.2103702"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","unstructured":"Mosaad Al Thokair Minjian Zhang Umang Mathur and Mahesh Viswanathan. 2023. Dynamic Race Detection with O(1) Samples. Proc. ACM Program. Lang. 7 POPL Article 45 (jan 2023) 30 pages. https:\/\/doi.org\/10.1145\/3571238 10.1145\/3571238","DOI":"10.1145\/3571238"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","unstructured":"H\u00fcnkar Can Tun\u00e7 Umang Mathur Andreas Pavlogiannis and Mahesh Viswanathan. 2023. Sound Dynamic Deadlock Prediction in Linear Time. Proc. ACM Program. Lang. 7 PLDI Article 177 (June 2023) 26 pages. https:\/\/doi.org\/10.1145\/3591291 10.1145\/3591291","DOI":"10.1145\/3591291"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","unstructured":"James R.Wilcox Parker Finch Cormac Flanagan and Stephen N. Freund. 2015. Array Shadow State Compression for Precise Dynamic Race Detection (T). In Proceedings of the 2015 30th IEEE\/ACM International Conference on Automated Software Engineering (ASE) (ASE '15). IEEE Computer Society Washington DC USA 155-165. https:\/\/doi.org\/10.1109\/ASE.2015.19 10.1109\/ASE.2015.19","DOI":"10.1109\/ASE.2015.19"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","unstructured":"Dylan Wolff Zheng Shi Gregory J. Duck Umang Mathur and Abhik Roychoudhury. 2024. Greybox Fuzzing for Concurrency Testing. In Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems Volume 2 (La Jolla CA USA) (ASPLOS '24). Association for Computing Machinery New York NY USA 482-498. https:\/\/doi.org\/10.1145\/3620665.3640389 10.1145\/3620665.3640389","DOI":"10.1145\/3620665.3640389"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","unstructured":"Benjamin P. Wood Man Cao Michael D. Bond and Dan Grossman. 2017. Instrumentation Bias for Dynamic Data Race Detection. Proc. ACM Program. Lang. 1 OOPSLA Article 69 (Oct. 2017) 31 pages. https:\/\/doi.org\/10.1145\/3133893 10.1145\/3133893","DOI":"10.1145\/3133893"},{"key":"e_1_3_2_62_2","doi-asserted-by":"crossref","unstructured":"Xinhao Yuan Junfeng Yang and Ronghui Gu. 2018. Partial order aware concurrency sampling. In Computer Aided Verification: 30th International Conference CAV 2018 Held as Part of the Federated Logic Conference FloC 2018 Oxford UK July 14-17 2018 Proceedings Part II 30. Springer 317-335.","DOI":"10.1007\/978-3-319-96142-2_20"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","unstructured":"Minjian Zhang Daniel Wee Soong Lim Umang Mathur Mahesh Viswanathan and Mosaad Al Thokair. 2025. Efficient Timestamping for Sampling-based Race Detection. https:\/\/doi.org\/10.5281\/zenodo.15231817 10.5281\/zenodo.15231817","DOI":"10.5281\/zenodo.15231817"},{"key":"e_1_3_2_64_2","doi-asserted-by":"crossref","unstructured":"Minjian Zhang Daniel Wee Soong Lim Mosaad Al Thokair Umang Mathur and Mahesh Viswanathan. 2025. Efficient Timestamping for Sampling-based Race Detection. arXiv:2504.06688 [cs.PL] https:\/\/arxiv.org\/abs\/2504.06688","DOI":"10.1145\/3729252"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","unstructured":"Tong Zhang Changhee Jung and Dongyoon Lee. 2017. ProRace: Practical Data Race Detection for Production Use. SIGPLAN Not. 52 4 (April 2017) 149-162. https:\/\/doi.org\/10.1145\/3093336.3037708 10.1145\/3093336.3037708","DOI":"10.1145\/3093336.3037708"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","unstructured":"Huan Zhao Dylan Wolff Umang Mathur and Abhik Roychoudhury. 2025. Selectively Uniform Concurrency Testing. In Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems Volume 1 (Rotterdam Netherlands) (ASPLOS '25). Association for Computing Machinery New York NY USA 1003-1019. https:\/\/doi.org\/10.1145\/3669940.3707214 10.1145\/3669940.3707214","DOI":"10.1145\/3669940.3707214"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","unstructured":"Qiyuan Zhao George P\u00eerlea Zhendong Ang Umang Mathur and Ilya Sergey. 2024. Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic. In Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (London UK) (CPP 2024). Association for Computing Machinery New York NY USA 45-59. https:\/\/doi.org\/10.1145\/3636501.3636944 10.1145\/3636501.3636944","DOI":"10.1145\/3636501.3636944"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","unstructured":"Mai Zheng Vignesh T. Ravi Feng Qin and Gagan Agrawal.2014. GMRace: Detecting Data Races in GPU Programs via a Low-Overhead Scheme. IEEE Transactions on Parallel and Distributed Systems 25 1 (2014) 104-115. https:\/\/doi.org\/10.1109\/TPDS.2013.44 10.1109\/TPDS.2013.44","DOI":"10.1109\/TPDS.2013.44"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729252","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:03:41Z","timestamp":1784196221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,10]]},"references-count":67,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2025,6,10]]}},"alternative-id":["10.1145\/3729252"],"URL":"https:\/\/doi.org\/10.1145\/3729252","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,10]]},"assertion":[{"value":"2024-11-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}