{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:10Z","timestamp":1780994650273,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":75,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Cybersecurity R&D Programme","award":["NRF- NCR25-Fuzz-0001"],"award-info":[{"award-number":["NRF- NCR25-Fuzz-0001"]}]},{"name":"Villum Fonden","award":["VIL42117"],"award-info":[{"award-number":["VIL42117"]}]},{"DOI":"10.13039\/100018227","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["None"],"award-info":[{"award-number":["None"]}],"id":[{"id":"10.13039\/100018227","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,12]]},"DOI":"10.1145\/3597503.3639099","type":"proceedings-article","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T16:43:26Z","timestamp":1712940206000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimistic Prediction of Synchronization-Reversal Data Races"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5021-7134","authenticated-orcid":false,"given":"Zheng","family":"Shi","sequence":"first","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7610-0660","authenticated-orcid":false,"given":"Umang","family":"Mathur","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8943-0722","authenticated-orcid":false,"given":"Andreas","family":"Pavlogiannis","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. ECP Proxy Applications. https:\/\/proxyapps.exascaleproject.org\/. Accessed: 2021-08-01."},{"key":"e_1_3_2_1_2_1","unstructured":"[n. d.]. Mantevo Project. https:\/\/mantevo.org\/. Accessed: 2021-08-01."},{"key":"e_1_3_2_1_3_1","unstructured":"[n. d.]. RaceInjector traces. https:\/\/github.com\/ALFA-group\/RaceInjector-counterexamples\/tree\/main. Accessed: 2023-07-14."},{"key":"e_1_3_2_1_4_1","unstructured":"[n. d.]. RAPID. https:\/\/github.com\/umangm\/rapid. Accessed: 2023-07-06."},{"key":"e_1_3_2_1_5_1","unstructured":"2014. CORAL Benchmarks. Accessed: 2021-08-01."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"2014. CORAL2 Benchmarks. Accessed: 2021-08-01.","DOI":"10.1055\/a-1253-0778"},{"key":"e_1_3_2_1_7_1","unstructured":"2023. Range Minima Query Solutions. https:\/\/en.wikipedia.org\/wiki\/Range_minimum_query. Accessed: 2023-07-18."},{"key":"e_1_3_2_1_8_1","unstructured":"2024. OSR implementation. https:\/\/zenodo.org\/records\/10437347. Accessed: 2024-01-11."},{"key":"e_1_3_2_1_9_1","unstructured":"2024. OSR technical report. https:\/\/arxiv.org\/abs\/2401.05642. Accessed: 2024-01-12."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535845"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678838"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632915"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125925"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276514"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414729.2414732"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806626"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735970.1736040"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468549"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523720"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310437"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 433--452","author":"Deligiannis Pantazis","year":"2023","unstructured":"Pantazis Deligiannis, Aditya Senthilnathan, Fahad Nayyar, Chris Lovett, and Akash Lal. 2023. Industrial-Strength Controlled Concurrency Testing for C# Programs with COYOTE. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 433--452."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-005-3861-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMPDP.2005.41"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213511"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632873"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_1_29_1","unstructured":"Lester Randolph Ford. 1956. Network flow theory. (1956)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808675"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the ACM on Programming Languages 3, OOPSLA","author":"Gen\u00e7 Kaan","year":"2019","unstructured":"Kaan Gen\u00e7, Jake Roemer, Yufan Xu, and Michael D Bond. 2019. Dependence-aware, unbounded sound predictive race detection. Proceedings of the ACM on Programming Languages 3, OOPSLA (2019), 1--30."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-005-1489-x"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594315"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00017"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276516"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062374"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81685-8_20"},{"key":"e_1_3_2_1_38_1","volume-title":"Dynamic Data-Race Detection Through the Fine-Grained Lens. In 32nd International Conference on Concurrency Theory.","author":"Kulkarni Rucha","year":"2021","unstructured":"Rucha Kulkarni, Umang Mathur, and Andreas Pavlogiannis. 2021. Dynamic Data-Race Detection Through the Fine-Grained Lens. In 32nd International Conference on Concurrency Theory."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-Companion.2019.00042"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126958"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446711"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542491"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276515"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507734"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394783"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434317"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378475"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16612-9_12"},{"key":"e_1_3_2_1_50_1","volume-title":"Proc. Internat. Sympos. Switching Theory","author":"Moore Edward F.","year":"1959","unstructured":"Edward F. Moore. 1959. The shortest path through a maze. In Proc. Internat. Sympos. Switching Theory 1957, Part II. Harvard Univ. Press, Cambridge, Mass., 285--292."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229457"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428298"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509514"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446748"},{"key":"e_1_3_2_1_56_1","volume-title":"Proceedings of the ACM on Programming Languages 4, POPL","author":"Pavlogiannis Andreas","year":"2019","unstructured":"Andreas Pavlogiannis. 2019. Fast, sound, and effectively complete dynamic race prediction. Proceedings of the ACM on Programming Languages 4, POPL (2019), 1--29."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781529"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385993"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192385"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192385"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688204.2688205"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/1986308.1986334"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_1_64_1","volume-title":"European Conference on Parallel Processing. Springer, 245--257","author":"Schmitz Adrian","year":"2019","unstructured":"Adrian Schmitz, Joachim Protze, Lechen Yu, Simon Schwitanski, and Matthias S M\u00fcller. 2019. DataRaceOnAccelerator-a micro-benchmark suite for evaluating correctness tools targeting accelerators. In European Conference on Parallel Processing. Springer, 245--257."},{"key":"e_1_3_2_1_65_1","volume-title":"FMOODS 2005, Athens, Greece, June 15--17, 2005. Proceedings 7. Springer, 211--226","author":"Sen Koushik","year":"2005","unstructured":"Koushik Sen, Grigore Ro\u015fu, and Gul Agha. 2005. Detecting errors in multithreaded programs by generalized predictive analysis of executions. In Formal Methods for Open Object-Based Distributed Systems: 7th IFIP WG 6.1 International Conference, FMOODS 2005, Athens, Greece, June 15--17, 2005. Proceedings 7. Springer, 211--226."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/1791194.1791203"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103702"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882300"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571238"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591291"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589250.3596142"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.023"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00078"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96142-2_20"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950332"}],"event":{"name":"ICSE '24: IEEE\/ACM 46th International Conference on Software Engineering","location":"Lisbon Portugal","acronym":"ICSE '24","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS","Faculty of Engineering of University of Porto"]},"container-title":["Proceedings of the IEEE\/ACM 46th International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597503.3639099","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597503.3639099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:49:11Z","timestamp":1750286951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597503.3639099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,12]]},"references-count":75,"alternative-id":["10.1145\/3597503.3639099","10.1145\/3597503"],"URL":"https:\/\/doi.org\/10.1145\/3597503.3639099","relation":{},"subject":[],"published":{"date-parts":[[2024,4,12]]},"assertion":[{"value":"2024-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}