{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:09Z","timestamp":1750220349487,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"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":["CCF-1733873,CCF-1910568,CCF-1943456,AitF-1733873,SPX-1725647,XPS-1439062,XPS-1533644"],"award-info":[{"award-number":["CCF-1733873,CCF-1910568,CCF-1943456,AitF-1733873,SPX-1725647,XPS-1439062,XPS-1533644"]}],"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":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461825","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"449-451","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Access History for Race Detection"],"prefix":"10.1145","author":[{"given":"Yifan","family":"Xu","sequence":"first","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]},{"given":"Anchengcheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]},{"given":"Grace Q.","family":"Yin","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Kunal","family":"Agrawal","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]},{"given":"I-Ting Angelina","family":"Lee","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]},{"given":"Tao B.","family":"Schardl","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.11"},{"volume-title":"On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures. 133--144","author":"Bender Michael A.","key":"e_1_3_2_1_2_1","unstructured":"Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , and Charles E. Leiserson . 2004 . On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures. 133--144 . Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Charles E. Leiserson. 2004. On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures. 133--144."},{"volume-title":"Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) . 1--11","author":"Feng Mingdong","key":"e_1_3_2_1_3_1","unstructured":"Mingdong Feng and Charles E. Leiserson . 1997. Efficient Detection of Determinacy Races in Cilk Programs . In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) . 1--11 . Mingdong Feng and Charles E. Leiserson. 1997. Efficient Detection of Determinacy Races in Cilk Programs. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) . 1--11."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000120"},{"volume-title":"Provably Good Race Detection That Runs in Parallel . Master's thesis","author":"Fineman Jeremy T.","key":"e_1_3_2_1_5_1","unstructured":"Jeremy T. Fineman . 2005. Provably Good Race Detection That Runs in Parallel . Master's thesis . Massachusetts Institute of Technology , Department of Electrical Engineering and Computer Science, Cambridge, MA. Jeremy T. Fineman. 2005. Provably Good Race Detection That Runs in Parallel . Master's thesis. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, Cambridge, MA."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125861"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/130616.130623"},{"volume-title":"Runtime Verification , , Howard Barringer, Ylies Falcone","author":"Raman Raghavan","key":"e_1_3_2_1_8_1","unstructured":"Raghavan Raman , Jisheng Zhao , Vivek Sarkar , Martin Vechev , and Eran Yahav . 2010. Efficient Data Race Detection for Async-Finish Parallelism . In Runtime Verification , , Howard Barringer, Ylies Falcone , Bernd Finkbeiner , Klaus Havelund, Insup Lee, Gordon Pace, Grigore Rosu, Oleg Sokolsky, and Nikolai Tillmann (Eds.). Lecture Notes in Computer Science, Vol. 6418 . Springer Berlin\/Heidelberg , 368--383. Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin Vechev, and Eran Yahav. 2010. Efficient Data Race Detection for Async-Finish Parallelism. In Runtime Verification , , Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, Gordon Pace, Grigore Rosu, Oleg Sokolsky, and Nikolai Tillmann (Eds.). Lecture Notes in Computer Science, Vol. 6418. Springer Berlin\/Heidelberg, 368--383."},{"key":"e_1_3_2_1_9_1","volume-title":"Aragon","author":"Seidel Raimund","year":"1996","unstructured":"Raimund Seidel and Cecilia R . Aragon . 1996 . Randomized Search Trees. In ALGORITHMICA. 540--545. Raimund Seidel and Cecilia R. Aragon. 1996. Randomized Search Trees. In ALGORITHMICA. 540--545."},{"volume-title":"Dynamic Determinacy Race Detection for Task Parallelism with Futures","author":"Surendran Rishi","key":"e_1_3_2_1_10_1","unstructured":"Rishi Surendran and Vivek Sarkar . 2016. Dynamic Determinacy Race Detection for Task Parallelism with Futures . Springer International Publishing , Cham , 368--385. Rishi Surendran and Vivek Sarkar. 2016. Dynamic Determinacy Race Detection for Task Parallelism with Futures .Springer International Publishing, Cham, 368--385."},{"key":"e_1_3_2_1_11_1","volume-title":"arxiv","author":"Tarjan Robert E.","year":"1806","unstructured":"Robert E. Tarjan , Caleb C. Levy , and Stephen Timmel . 2018. Zip Trees . arxiv : 1806 .06726 [cs.DS] Robert E. Tarjan, Caleb C. Levy, and Stephen Timmel. 2018. Zip Trees. arxiv: 1806.06726 [cs.DS]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935801"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295732"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178515"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374536"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461825","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3409964.3461825","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461825","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":15,"alternative-id":["10.1145\/3409964.3461825","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461825","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}