{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T11:08:02Z","timestamp":1790075282725,"version":"4.0.1"},"reference-count":86,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T00:00:00Z","timestamp":1780876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,6,8]]},"abstract":"<jats:p>Garbage collection (GC) remains a desirable yet elusive goal in unmanaged languages like C\/C++ and Rust, where concurrent memory reclamation must be achieved without compiler or runtime support. Existing techniques face fundamental trade-offs among efficiency, safety, and ease of integration: tracing collectors like BDWGC incur costly stop-the-world pauses and unsafe conservative scanning, while reference counting schemes like CIRC are safe but introduce high overhead and require manual handling of cyclic data.<\/jats:p>\n                  <jats:p>\n                    We present a safe, efficient, and easy-to-integrate concurrent GC library, revisiting\n                    <jats:italic toggle=\"yes\">partial tracing<\/jats:italic>\n                    (PT), a concept initially conceived by Bacon et al. 22 years ago. PT is a hybrid approach that maintains reference counts for roots, ensuring safety through precise root identification, and traces from objects with non-zero counts, offering ease of integration by handling cyclic garbage. Although PT has historically been considered inefficient due to the high cost of root mutation, we overcome this limitation in two design steps. First,\n                    <jats:italic toggle=\"yes\">Concurrent Partial Tracing<\/jats:italic>\n                    (CPT) introduces\n                    <jats:italic toggle=\"yes\">phase consensus<\/jats:italic>\n                    , enabling concurrent phase coordination without mutator suspension and eliminating most reference-count updates during traversal. Second,\n                    <jats:italic toggle=\"yes\">Concurrent Deferred Partial Tracing<\/jats:italic>\n                    (CDPT) further reduces overhead by replacing atomic root updates with a lightweight,\n                    <jats:italic toggle=\"yes\">hazard pointer<\/jats:italic>\n                    (HP)-based mechanism safeguarded by a\n                    <jats:italic toggle=\"yes\">phase barrier<\/jats:italic>\n                    . We show that CDPT outperforms automatic collectors like BDWGC and CIRC while being comparable to manual schemes like RCU, through both micro-benchmarks on concurrent data structures and a macro-benchmark on Moka, a production cache library.\n                  <\/jats:p>","DOI":"10.1145\/3808310","type":"journal-article","created":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T18:04:09Z","timestamp":1780941849000},"page":"1583-1609","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Partial Tracing for Safe, Efficient, and Concurrent Garbage Collection in Unmanaged Languages"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7070-3578","authenticated-orcid":false,"given":"Jeonghyeon","family":"Kim","sequence":"first","affiliation":[{"name":"KAIST, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6629-449X","authenticated-orcid":false,"given":"Jongse","family":"Park","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5602-2397","authenticated-orcid":false,"given":"Youngjin","family":"Kwon","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2115-0871","authenticated-orcid":false,"given":"Jeehoon","family":"Kang","sequence":"additional","affiliation":[{"name":"FuriosaAI, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,8]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"243","volume-title":"International Conference on Parallel Processing, ICPP\u201987, University Park, PA, USA, August 1987","author":"Abraham Santosh G.","year":"1987","unstructured":"Santosh G. Abraham, Janak H. Patel. 1987. Parallel Garbage Collection on a Virtual Memory System. International Conference on Parallel Processing, ICPP\u201987, University Park, PA, USA, August 1987. Pennsylvania State University Press, 243\u2013246."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Aditya Anand Solai Adithya Swapnil Rustagi Priyam Seth Vijay Sundaresan Daryl Maier V. Krishna Nandivada Manas Thakur. 2024. Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes. 8 PLDI Article 159 Proc. ACM Program. Lang. (June 2024) 24 pages. doi:10.1145\/3656389.","DOI":"10.1145\/3656389"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523730"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1028976.1028982"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Mordechai Ben-Ari. 1984. Algorithms for on-the-fly garbage collection. ACM Trans. Program. Lang. Syst. 6 3 333\u2013344. (July 1984). doi:10.1145\/579.587","DOI":"10.1145\/579.587"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Naama Ben-David Guy E. Blelloch Panagiota Fatourou Eric Ruppert Yihan Sun Yuanhao Wei. 2021. Space and Time Bounded Multiversion Garbage Collection. 35th International Symposium on Distributed Computing (DISC 2021) (Leibniz International Proceedings in Informatics (LIPIcs) Vol. 209) Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik Dagstuhl Germany 12:1\u201312:20. doi:10.4230\/LIPIcs.DISC.2021.12.","DOI":"10.4230\/LIPIcs.DISC.2021.12"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Bruno Blanchet. 2003. Escape analysis for JavaTM: Theory and practice. ACM Trans. Program. Lang. Syst. 25 6 713\u2013775. (Nov. 2003). doi:10.1145\/945885.945886","DOI":"10.1145\/945885.945886"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/231379.231394"},{"key":"e_1_3_1_11_2","unstructured":"Hans-J. Boehm n.d. Advantages and Disadvantages of Conservative Garbage Collection https:\/\/www.hboehm.info\/gc\/issues.html. Accessed: 2025-11-09."},{"key":"e_1_3_1_12_2","unstructured":"Hans-J. Boehm n.d. Conservative GC Algorithmic Overview https:\/\/www.hboehm.info\/gc\/gcdescr.html. Accessed: 2025-11-09."},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Hans-J. Boehm Alan J. Demers Scott Shenker. 1991. Mostly parallel garbage collection. 26 6 157\u2013164. SIGPLAN Not. (May 1991). doi:10.1145\/113446.113459.","DOI":"10.1145\/113446.113459"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Hans-Juergen Boehm Mark Weiser. 1988. Garbage Collection in an Uncooperative Environment. 18 9 807\u2013820. (1988). doi:10.1002\/spe.4380180902","DOI":"10.1002\/spe.4380180902"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","unstructured":"Chandrasekhar Boyapati Alexandru Salcianu William Beebee Martin Rinard. 2003. Ownership types for safe region-based memory management in real-time Java. SIGPLAN Not. 38 5 (May 2003) 324\u2013337. doi:10.1145\/780822.781168","DOI":"10.1145\/780822.781168"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Trevor Brown Faith Ellen Eric Ruppert. 2014. A General Technique for Non-Blocking Trees. SIGPLAN Not. 49 8 329\u2013342. (feb 2014). doi:10.1145\/2692916.2555267","DOI":"10.1145\/2692916.2555267"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Trevor Alexander Brown. 2015. Reclaiming Memory for Lock-Free Data Structures: There Has to Be a Better Way. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Donostia-San Sebasti\u00e2n Spain) (PODC \u201915). Association for Computing Machinery New York NY USA 261\u2013270. doi:10.1145\/2767386.2767436","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","unstructured":"David Chase Yossi Lev. 2005. Dynamic circular work-stealing deque. In Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures. 21\u201328","DOI":"10.1145\/1073970.1073974"},{"key":"e_1_3_1_19_2","unstructured":"Wyatt Childers Peter Dimov Dan Katz Barry Revzin Andrew Sutton Faisal Vali Daveed Vandevoorde. 2025. Reflection for C++26. ISO\/IEC JTC1\/SC22\/WG21 proposal P2996R12. https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2025\/p2996r12.html"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","unstructured":"Jong-Deok Choi Manish Gupta Mauricio Serrano Vugranam C. Sreedhar Sam Midkiff. 1999. Escape analysis for Java. In Proceedings of the 14th ACM SIGPLAN Conference on Object-Oriented Programming Systems Languages and Applications (Denver Colorado USA) (OOPSLA \u201999). Association for Computing Machinery New York NY USA 1\u201319.doi:10.1145\/320384.320386","DOI":"10.1145\/320384.320386"},{"key":"e_1_3_1_21_2","unstructured":"Austin Clements Rick Hudson. 2016. Technical Report. Google Go Project. In Proposal: Eliminate STW Stack Rescanning. Last updated: 2016\u201310\u201321. https:\/\/go.googlesource.com\/proposal\/+\/master\/design\/17503-eliminate-rescan.md"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Nachshon Cohen. 2018. Every Data Structure Deserves Lock-Free Memory Reclamation. Proc. ACM Program. Lang. OOPSLA Article 143 (oct 2018) 24 pages. doi:10.1145\/3276513","DOI":"10.1145\/3276513"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Brian F. Cooper Adam Silberstein Erwin Tam Raghu Ramakrishnan Russell Sears. 2010. Benchmarking cloud serving systems with YCSB. In Proceedings of the 1st ACM Symposium on Cloud Computing (Indianapolis Indiana USA) (SoCC \u201910). Association for Computing Machinery New York NY USA 143\u2013154. doi:10.1145\/1807128.1807152","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","unstructured":"Andreia Correia Pedro Ramalhete Pascal Felber. 2021. OrcGC: Automatic Lock-Free Memory Reclamation. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Virtual Event Republic of Korea) (PPoPP \u201921). Association for Computing Machinery New York NY USA 205\u2013218. doi:10.1145\/3437801.3441596","DOI":"10.1145\/3437801.3441596"},{"key":"e_1_3_1_25_2","unstructured":"Crossbeam Developers. 2023. Crossbeam . https:\/\/github.com\/crossbeam-rs\/crossbeam"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","unstructured":"David Detlefs Christine Flood Steve Heller Tony Printezis. 2004. Garbage-first garbage collection. In Proceedings of the 4th International Symposium on Memory Management (Vancouver BC Canada) (ISMM \u201904). Association for Computing Machinery 37\u201348 New York NY USA. doi:10.1145\/1029873.1029879","DOI":"10.1145\/1029873.1029879"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/360336.360345"},{"key":"e_1_3_1_28_2","unstructured":"Moka Developers. 2026. Moka: A high performance concurrent caching library for Rust v0.12.13. https:\/\/github.com\/moka-rs\/moka"},{"key":"e_1_3_1_29_2","unstructured":"Dave Dice Hui Huang Mingyao Yang. 2001. Asymmetric Dekker Synchronization . http:\/\/web.archive.org\/web\/20080220051535\/http:\/\/blogs.sun.com\/dave\/resource\/Asymmetric-Dekker-Synchronization.txt"},{"key":"e_1_3_1_30_2","unstructured":"Edsger W. Dijkstra Leslie Lamport A. J. Martin C. S. Scholten E. F. M. Steffens. 1976. On-the-fly garbage collection: an exercise in cooperation. Language Hierarchies and Interfaces Friedrich L. Bauer E. W. Dijkstra A. Ershov M. Griffiths C. A. R. Hoare W. A. Wulf and Klaus Samelson (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 43\u201356"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/359642.359655"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Dana Drachsler Martin Vechev Eran Yahav. 2014. Practical Concurrent Binary Search Trees via Logical Ordering. SIGPLAN Not. 49 8 343\u2013356. (feb 2014). doi:10.1145\/2692916.2555269","DOI":"10.1145\/2692916.2555269"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","unstructured":"Faith Ellen Panagiota Fatourou Eric Ruppert Franck van Breugel. 2010. Non-Blocking Binary Search Trees. In Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (Zurich Switzerland) (PODC \u201910). Association for Computing Machinery New York NY USA 131\u2013140. doi:10.1145\/1835698.1835736","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","unstructured":"Toshio Endo Kenjiro Taura. 2002. Reducing pause time of conservative collectors. In Proceedings of the 3rd International Symposium on Memory Management (Berlin Germany) (ISMM \u201902). Association for Computing Machinery New York NY USA 119\u2013131. doi:10.1145\/512429.512432","DOI":"10.1145\/512429.512432"},{"key":"e_1_3_1_35_2","unstructured":"Jason Evans. 2006. A scalable concurrent malloc (3) implementation for FreeBSD"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Christine H. Flood Roman Kennke Andrew Dinn Andrew Haley Roland Westrelin. 2016. Shenandoah: An open-source concurrent compacting garbage collector for OpenJDK. In Proceedings of the 13th International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machines Languages and Tools (Lugano Switzerland) (PPPJ \u201916). Association for Computing Machinery New York NY USA Article 13 Article 13 9pages. doi:10.1145\/2972206.2972210","DOI":"10.1145\/2972206.2972210"},{"key":"e_1_3_1_37_2","unstructured":"Keir Fraser. 2004. Practical lock-freedom. Ph. D. Dissertation. University of Cambridge Computer Laboratory"},{"key":"e_1_3_1_38_2","unstructured":"David Goldblatt. 2022. P1202R5: Asymmetric Fences . https:\/\/wg21.link\/p1202r5"},{"key":"e_1_3_1_39_2","doi-asserted-by":"crossref","unstructured":"Timothy L. Harris. 2001. A Pragmatic Implementation of Non-Blocking Linked-Lists. In Proceedings of the 15th International Conference on Distributed Computing (DISC \u201901). Springer-Verlag Berlin Heidelberg 300\u2013314.","DOI":"10.1007\/3-540-45414-4_21"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","unstructured":"Laurence Hellyer Richard Jones Antony L. Hosking. 2010. The locality of concurrent write barriers. In Proceedings of the 2010 International Symposium on Memory Management (Toronto Ontario Canada) (ISMM \u201910). Association for Computing Machinery New York NY USA 83\u201392. doi:10.1145\/1806651.1806666","DOI":"10.1145\/1806651.1806666"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","unstructured":"Martin Hirzel Amer Diwan. 2000. On the type accuracy of garbage collection. In Proceedings of the 2nd International Symposium on Memory Management (Minneapolis Minnesota USA) (ISMM \u201900). Association for Computing Machinery New York NY USA 1\u201311. doi:10.1145\/362422.362428","DOI":"10.1145\/362422.362428"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","unstructured":"Shane V. Howley Jeremy Jones. 2012. A Non-Blocking Internal Binary Search Tree. In Proceedings of the Twenty- Fourth Annual ACM Symposium on Parallelism in Algorithms and Architectures (Pittsburgh Pennsylvania USA) (SPAA \u201912). Association for Computing Machinery New York NY USA 161\u2013171.doi:10.1145\/2312005.2312036","DOI":"10.1145\/2312005.2312036"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","unstructured":"Jacob Hughes Laurence Tratt. 2025. Garbage Collection for Rust: The Finalizer Frontier. Proc. ACM Program. Lang. 9 OOPSLA2 Article 401 (Oct. 2025) 27 pages. doi:10.1145\/3763179","DOI":"10.1145\/3763179"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","unstructured":"DeLesley Hutchins Aaron Ballman Dean Sutherland. 2014. C\/C++ Thread Safety Analysis. 2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation. 41\u201346. doi:10.1109\/SCAM.2014.34","DOI":"10.1109\/SCAM.2014.34"},{"key":"e_1_3_1_45_2","unstructured":"Trevor Jim J. Greg Morrisett Dan Grossman Michael W. Hicks James Cheney Yanling Wang. 2002. A Cyclone: A Safe Dialect of C. In Proceedings of the General Track of the Annual Conference on USENIX Annual Technical Conference (ATEC \u201902). USENIX Association 275\u2013288. USA"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781003276142"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","unstructured":"Jaehwang Jung Jeonghyeon Kim Matthew J. Parkinson Jeehoon Kang. 2024. Concurrent Immediate Reference Counting. Proc. ACM Program. Lang. 8 PLDI Article 153 (June 2024) 24 pages. doi:10.1145\/3656383","DOI":"10.1145\/3656383"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","unstructured":"Jaehwang Jung Janggun Lee Jeonghyeon Kim Jeehoon Kang. 2023. Applying Hazard Pointers to More Concurrent Data Structures. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (Orlando FL USA) (SPAA \u201923). Association for Computing Machinery New York NY USA 213\u2013226. doi:10.1145\/3558481.3591102","DOI":"10.1145\/3558481.3591102"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","unstructured":"Jeehoon Kang Jaehwang Jung. 2020. A Marriage of Pointer- and Epoch-Based Reclamation. 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 314\u2013328. doi:10.1145\/3385412.3385978","DOI":"10.1145\/3385412.3385978"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","unstructured":"Jeonghyeon Kim Jaehwang Jung Jeehoon Kang. 2024. Expediting Hazard Pointers with Bounded RCU Critical Sections. In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (Nantes France) (SPAA \u201924). Association for Computing Machinery New York NY USA 1\u201313. doi:10.1145\/3626183.3659941","DOI":"10.1145\/3626183.3659941"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","unstructured":"Jeonghyeon Kim Jongse Park Youngjin Kwon Jeehoon Kang. 2026. Artifact and Appendix for \u201cRevisiting Partial Tracing for Safe Efficient and Concurrent Garbage Collection in Unmanaged Languages\u201d Latest. doi:10.5281\/zenodo.19058584","DOI":"10.5281\/zenodo.19058584"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","unstructured":"Jeonghyeon Kim Jongse Park Youngjin Kwon Jeehoon Kang. 2026. Artifact and Appendix for \u201cRevisiting Partial Tracing for Safe Efficient and Concurrent Garbage Collection in Unmanaged Languages\u201d v3. doi:10.5281\/zenodo.19597312","DOI":"10.5281\/zenodo.19597312"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","unstructured":"Marisa Kirisame Pranav Shenoy Pavel Panchekha. 2022. Optimal heap limits for reducing browser memory use. Proc. ACM Program. Lang. 6 OOPSLA2 Article 160 (Oct. 2022) 21 pages. doi:10.1145\/3563323","DOI":"10.1145\/3563323"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","unstructured":"Iacovos G. Kolokasis Giannos Evdorou Shoaib Akram Christos Kozanitis Anastasios Papagiannis Foivos S. Zakkak Polyvios Pratikakis Angelos Bilas. 2023. TeraHeap: Reducing Memory Pressure in Managed Big Data Frameworks. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems Volume 3 (Vancouver BC Canada) (ASPLOS 2023). Association for Computing Machinery New York NY USA 694\u2013709. doi:10.1145\/3582016.3582045","DOI":"10.1145\/3582016.3582045"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","unstructured":"Janggun Lee Jeonghyeon Kim Jeehoon Kang. 2025. Leveraging Immutability to Validate Hazard Pointers for Optimistic Traversals. Proc. ACM Program. Lang. 9 PLDI Article 148 (June 2025) 22 pages. doi:10.1145\/3729247","DOI":"10.1145\/3729247"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/358141.358147"},{"key":"e_1_3_1_58_2","unstructured":"Paul E. McKenney. 2004. Exploiting Deferred Destruction: An Analysis of Read-Copy-Update Techniques in Operating System Kernels. Ph. D. Dissertation. OGI School of Science and Engineering at Oregon Health and Sciences University"},{"key":"e_1_3_1_59_2","unstructured":"P. E. McKenney J. D. Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In PDCS \u201998"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","unstructured":"Maged M. Michael. 2002. Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic Reads and Writes. In Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing (Monterey California) (PODC \u201902). Association for Computing Machinery New York NY USA 21\u201330. doi:10.1145\/571825.571829","DOI":"10.1145\/571825.571829"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","unstructured":"Maged M. Michael. 2004. Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Trans. Parallel Distrib. Syst. 15 6 (June 2004) 491\u2013504. doi:10.1109\/TPDS.2004.8","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","unstructured":"Aravind Natarajan Neeraj Mittal. 2014. Fast Concurrent Lock-Free Binary Search Trees. In Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Orlando Florida USA) (PPoPP \u201914). Association for Computing Machinery New York NY USA 317\u2013328. doi:10.1145\/2555243.2555256","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","unstructured":"Ruslan Nikolaev Binoy Ravindran. 2020. Universal Wait-Free Memory Reclamation. Association for Computing Machinery New York NY USA 130\u2013143. doi:10.1145\/3332466.3374540","DOI":"10.1145\/3332466.3374540"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","unstructured":"Ruslan Nikolaev Binoy Ravindran. 2021. Snapshot-Free Transparent and Robust Memory Reclamation for Lock-Free Data Structures. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (Virtual Canada) (PLDI 2021). Association for Computing Machinery New York NY USA 987\u20131002.doi:10.1145\/3453483.3454090","DOI":"10.1145\/3453483.3454090"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","unstructured":"Ruslan Nikolaev Binoy Ravindran. 2024. A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation. Proc. ACM Program. Lang. 8 PLDI Article 235 (June 2024) 25 pages. doi:10.1145\/3658851","DOI":"10.1145\/3658851"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","unstructured":"Matthew Parkinson Dimitrios Vytiniotis Kapil Vaswani Manuel Costa Pantazis Deligiannis Dylan McDermott Aaron Blankstein Jonathan Balkind. 2017. Project Snowflake: Non-Blocking Safe Manual Memory Management in .NET. Proc. ACM Program. Lang. 1 OOPSLA Article 95 (oct 2017) 25 pages. doi:10.1145\/3141879","DOI":"10.1145\/3141879"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","unstructured":"Arunmoezhi Ramachandran Neeraj Mittal. 2015. A Fast Lock-Free Internal Binary Search Tree. In Proceedings of the 16th International Conference on Distributed Computing and Networking (Goa India) (ICDCN \u201915). Association for Computing Machinery New York NY USA Article 37 10 pages. doi:10.1145\/2684464.2684472","DOI":"10.1145\/2684464.2684472"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","unstructured":"Pedro Ramalhete Andreia Correia. 2017. Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (Washington DC USA) (SPAA \u201917). Association for Computing Machinery New York NY USA 367\u2013369. doi:10.1145\/3087556.3087588","DOI":"10.1145\/3087556.3087588"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","unstructured":"Alex Reinking Ningning Xie Leonardo de Moura Daan Leijen. 2021. Perceus: garbage free reference counting with reuse. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (Virtual Canada) (PLDI 2021). Association for Computing Machinery New York NY USA 96\u2013111. doi:10.1145\/3453483.3454032","DOI":"10.1145\/3453483.3454032"},{"key":"e_1_3_1_70_2","unstructured":"rust-gc Developers. 2025. rust-gc. accessed 12 Nov 2025. https:\/\/github.com\/Manishearth\/rust-gc"},{"key":"e_1_3_1_71_2","unstructured":"Nir N Shavit Yosef Lev Maurice P Herlihy. 2011. Concurrent lock-free skiplist with wait-free contains operator. US Patent 7 937 378. https:\/\/patentcenter.uspto.gov\/applications\/12191008"},{"key":"e_1_3_1_72_2","doi-asserted-by":"publisher","unstructured":"Gali Sheffi Maurice Herlihy Erez Petrank. 2021. VBR: Version Based Reclamation. 35th International Symposium on Distributed Computing (DISC 2021) (Leibniz International Proceedings in Informatics (LIPIcs) Vol. 209) Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik Dagstuhl Germany 35:1\u201335:18. doi:10.4230\/LIPIcs.DISC.2021.35","DOI":"10.4230\/LIPIcs.DISC.2021.35"},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","unstructured":"Gali Sheffi Erez Petrank. 2023. The ERA Theorem for Safe Memory Reclamation. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Orlando FL USA) (PODC \u201923). Association for Computing Machinery New York NY USA 102\u2013112. doi:10.1145\/3583668.3594564","DOI":"10.1145\/3583668.3594564"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","unstructured":"Ajay Singh Trevor Brown Ali Mashtizadeh. 2021. NBR: Neutralization Based Reclamation. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Virtual Event Republic of Korea) (PPoPP \u201921). Association for Computing Machinery New York NY USA 175\u2013190. doi:10.1145\/3437801.3441625","DOI":"10.1145\/3437801.3441625"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","unstructured":"Codrut Stancu Christian Wimmer Stefan Brunthaler Per Larsen Michael Franz. 2015. Safe and efficient hybrid memory management for Java. In Proceedings of the 2015 International Symposium on Memory Management (Portland OR USA) (ISMM \u201915). Association for Computing Machinery New York NY USA 81\u201392. doi:10.1145\/2754169.2754185","DOI":"10.1145\/2754169.2754185"},{"key":"e_1_3_1_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361005"},{"key":"e_1_3_1_77_2","unstructured":"Herb Sutter. 2019. Lifetime Safety: Preventing Common Dangling. ISO\/IEC JTC1\/SC22\/WG21 proposal P1179R1. https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2019\/p1179r1.pdf"},{"key":"e_1_3_1_78_2","unstructured":"rust-gc Developers. 2015. \u201cImplement Cgc - a concurrent threadsafe garbage collector\u201d (pull request #6). GitHub pull request accessed 12 Nov 2025. https:\/\/github.com\/Manishearth\/rust-gc\/pull\/6"},{"key":"e_1_3_1_79_2","unstructured":"The BDWGC Project. 2025. BDWGC. https:\/\/github.com\/bdwgc\/bdwgc"},{"key":"e_1_3_1_80_2","doi-asserted-by":"publisher","unstructured":"Charles Tripp David Hyde Benjamin Grossman-Ponemon. 2018. FRC: A High-Performance Concurrent Parallel Deferred Reference Counter for C++. In Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management (Philadelphia PA USA) (ISMM 2018). Association for Computing Machinery New York NY USA 14\u201328. doi:10.1145\/3210563.3210569","DOI":"10.1145\/3210563.3210569"},{"key":"e_1_3_1_81_2","doi-asserted-by":"publisher","unstructured":"David Ungar. 1984. Generation Scavenging: A non-disruptive high performance storage reclamation algorithm. In Proceedings of the First ACM SIGSOFT\/SIGPLAN Software Engineering Symposium on Practical Software Development Environments (SDE 1). Association for Computing Machinery New York NY USA 157\u2013167. doi:10.1145\/800020.808261","DOI":"10.1145\/800020.808261"},{"key":"e_1_3_1_82_2","doi-asserted-by":"publisher","unstructured":"Nick Wanninger Tommy McMichen Simone Campanoni Peter Dinda. 2024. Getting a Handle on Unmanaged Memory. In Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems Volume 3 (La Jolla CA USA) (ASPLOS \u201924). Association for Computing Machinery New York NY USA 448\u2013463. doi:10.1145\/3620666.3651326","DOI":"10.1145\/3620666.3651326"},{"key":"e_1_3_1_83_2","doi-asserted-by":"publisher","unstructured":"Haosen Wen Joseph Izraelevitz Wentao Cai H. Alan Beadle Michael L. Scott. 2018. Interval-Based Memory Reclamation. In Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Vienna Austria) (PPoPP \u201918). Association for Computing Machinery New York NY USA 1\u201313. doi:10.1145\/3178487.3178488","DOI":"10.1145\/3178487.3178488"},{"key":"e_1_3_1_84_2","doi-asserted-by":"publisher","unstructured":"Albert Mingkun Yang Tobias Wrigstad. 2017. Type-Assisted Automatic Garbage Collection for Lock-Free Data Structures. In Proceedings of the 2017 ACM SIGPLAN International Symposium on Memory Management (Barcelona Spain) (ISMM 2017). Association for Computing Machinery New York NY USA 14\u201324. doi:10.1145\/3092255.3092274","DOI":"10.1145\/3092255.3092274"},{"key":"e_1_3_1_85_2","doi-asserted-by":"publisher","unstructured":"Albert Mingkun Yang Tobias Wrigstad. 2022. Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK. ACM Trans. Program. Lang. Syst. 44 4 Article 22 (Sept. 2022) 34 pages. doi:10.1145\/3538532","DOI":"10.1145\/3538532"},{"key":"e_1_3_1_86_2","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(90)90084-Y"},{"key":"e_1_3_1_87_2","doi-asserted-by":"publisher","unstructured":"Wenyu Zhao Stephen M. Blackburn Kathryn S. McKinley. 2022. Low-Latency High-Throughput Garbage Collection. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (San Diego CA USA) (PLDI2022). Association for Computing Machinery New York NY USA 76\u201391. doi:10.1145\/3519939.3523440","DOI":"10.1145\/3519939.3523440"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3808310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T10:48:01Z","timestamp":1790074081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3808310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,8]]},"references-count":86,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2026,6,8]]}},"alternative-id":["10.1145\/3808310"],"URL":"https:\/\/doi.org\/10.1145\/3808310","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,8]]},"assertion":[{"value":"2025-11-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}