{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T02:39:37Z","timestamp":1793846377414,"version":"4.6.1"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,10,9]]},"abstract":"<jats:p>\n                    Generative AI has shown its value for many software engineering tasks. Still in its infancy, large language model (LLM)-based proof generation lags behind LLM-based code generation. In this paper, we present A\n                    <jats:sc>uto<\/jats:sc>\n                    V\n                    <jats:sc>erus<\/jats:sc>\n                    . A\n                    <jats:sc>uto<\/jats:sc>\n                    V\n                    <jats:sc>erus<\/jats:sc>\n                    uses LLMs to automatically generate correctness proof for Rust code. A\n                    <jats:sc>uto<\/jats:sc>\n                    V\n                    <jats:sc>erus<\/jats:sc>\n                    is designed to match the unique features of Verus, a verification tool that can prove the correctness of Rust code using proofs and specifications also written in Rust. A\n                    <jats:sc>uto<\/jats:sc>\n                    V\n                    <jats:sc>erus<\/jats:sc>\n                    consists of a network of agents that are crafted and orchestrated to mimic human experts\u2019 three phases of proof construction: preliminary proof generation, proof refinement guided by generic tips, and proof debugging guided by verification errors. To thoroughly evaluate A\n                    <jats:sc>uto<\/jats:sc>\n                    V\n                    <jats:sc>erus<\/jats:sc>\n                    and help foster future research in this direction, we have built a benchmark suite of 150 non-trivial proof tasks, based on existing code-generation benchmarks and verification benchmarks. Our evaluation shows that A\n                    <jats:sc>uto<\/jats:sc>\n                    V\n                    <jats:sc>erus<\/jats:sc>\n                    can automatically generate correct proof for more than 90% of them, with more than half of them tackled in less than 30 seconds or 3 LLM calls.\n                  <\/jats:p>","DOI":"10.1145\/3763174","type":"journal-article","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T08:49:50Z","timestamp":1759999790000},"page":"3454-3482","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["AutoVerus: Automated Proof Generation for Rust Code"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7976-5086","authenticated-orcid":false,"given":"Chenyuan","family":"Yang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign0009-0000-1371-2179, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1371-2179","authenticated-orcid":false,"given":"Xuheng","family":"Li","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7931-6782","authenticated-orcid":false,"given":"Md Rakib Hossain","family":"Misu","sequence":"additional","affiliation":[{"name":"University of California at Irvine, Irvine, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4675-8980","authenticated-orcid":false,"given":"Jianan","family":"Yao","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2871-9485","authenticated-orcid":false,"given":"Weidong","family":"Cui","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9954-9674","authenticated-orcid":false,"given":"Yeyun","family":"Gong","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5676-0362","authenticated-orcid":false,"given":"Chris","family":"Hawblitzel","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4446-4777","authenticated-orcid":false,"given":"Shuvendu","family":"Lahiri","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7269-2769","authenticated-orcid":false,"given":"Jacob R.","family":"Lorch","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7466-2064","authenticated-orcid":false,"given":"Shuai","family":"Lu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0378-060X","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2762-0989","authenticated-orcid":false,"given":"Ziqiao","family":"Zhou","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0757-4600","authenticated-orcid":false,"given":"Shan","family":"Lu","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, USA"},{"name":"University of Chicago, Chicago, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,10,9]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3360573"},{"key":"e_1_3_1_3_2","unstructured":"Jacob Austin Augustus Odena Maxwell I. Nye Maarten Bosma Henryk Michalewski David Dohan Ellen Jiang Carrie J. Cai Michael Terry Quoc V. Le and Charles Sutton. 2021. Program Synthesis with Large Language Models. CoRR abs\/2108.07732 (2021). https:\/\/arxiv.org\/abs\/2108.07732"},{"key":"e_1_3_1_4_2","first-page":"454","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research, Vol. 97)","author":"Bansal Kshitij","year":"2019","unstructured":"Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy, and Stewart Wilcox. 2019. HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research, Vol. 97). PMLR, 454\u2013463. http:\/\/proceedings.mlr.press\/v97\/bansall9a.html"},{"issue":"11","key":"e_1_3_1_5_2","article-title":"The Coq proof assistant reference manual","volume":"6","author":"Barras Bruno","year":"1999","unstructured":"Bruno Barras, Samuel Boutin, Cristina Cornes, Judica\u0451l Courant, Yann Coscoy, David Delahaye, Daniel de Rauglaudre, Jean-Christophe Filli\u00e2tre, Eduardo Gim\u00e9nez, Hugo Herbelin,et al. 1999. The Coq proof assistant reference manual. INRIA, version 6, 11 (1999). https:\/\/hal.science\/inria-00069919","journal-title":"INRIA, version"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Saikat Chakraborty Gabriel Ebner Siddharth Bhat Sarah Fakhoury Sakina Fatima Shuvendu K. Lahiri and Nikhil Swamy. 2024. Towards Neural Synthesis for SMT-Assisted Proof-Oriented Programming. CoRR abs\/2405.01787 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2405.01787 10.48550\/ARXIV.2405.01787","DOI":"10.48550\/ARXIV.2405.01787"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81688-9_42"},{"key":"e_1_3_1_8_2","unstructured":"Mark Chen Jerry Tworek Heewoo Jun Qiming Yuan Henrique Ponde De Oliveira Pinto Jared Kaplan Harri Edwards Yuri Burda NicholasJoseph Greg Brockman et al. 2021. Evaluating large language models trained on code. CoRR abs\/2107.03374 (2021). https:\/\/arxiv.org\/abs\/2107.03374"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3625275.3625401"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79876-5_37"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598067"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17244-l_6"},{"key":"e_1_3_1_13_2","unstructured":"ETAPS. 2024. 10th Competition on Software Verification (SV-COMP 2021). https:\/\/sv-comp.sosy-lab.org\/2021\/. [Online] [Accessed: 2024-09-01]."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Sarah Fakhoury Markus Kuppe Shuvendu K. Lahiri Tahina Ramananandro and Nikhil Swamy. 2024. 3DGen: AI-Assisted Generation of Provably Correct Binary Format Parsers. CoRR abs\/2404.10362 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2404.10362 10.48550\/ARXIV.2404.10362","DOI":"10.48550\/ARXIV.2404.10362"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428299"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428299"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616243"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45251-6_29"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3656422"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3547647"},{"key":"e_1_3_1_21_2","unstructured":"Rijul Jain Shraddha Barke Gabriel Ebner Md Rakib Hossain Misu Shan Lu and Sarah Fakhoury. 2025. What\u2019s in a Proof? Analyzing Expert Proof-Writing Processes in F* and Verus. arXiv preprint arXiv:2508.02733 (2025)."},{"key":"e_1_3_1_22_2","unstructured":"Albert Qiaochu Jiang Wenda Li Szymon Tworkowski Konrad Czechowski Tomasz Odrzyg\u00f4zdz Piotr Milos Yuhuai Wu and Mateja Jamnik. 2022. Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers. In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022 NeurIPS 2022 New Orleans LA USA November 28 - December 9 2022. http:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/377c25312668e48f2e531e2f2c422483-Abstract-Conference.html"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158154"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","unstructured":"Adharsh Kamath Aditya Senthilnathan Saikat Chakraborty Pantazis Deligiannis Shuvendu K. Lahiri Akash Lal Aseem Rastogi Subhajit Roy and Rahul Sharma. 2023. Finding Inductive Loop Invariants using Large Language Models. CoRR abs\/2311.07948 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2311.07948 10.48550\/ARXIV.2311.07948","DOI":"10.48550\/ARXIV.2311.07948"},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Andrea Lattuada Travis Hance Jay Bosamiya Matthias Brun Chanhee Cho Hayley LeBlanc Pranav Srinivasan Reto Achermann Tej Chajed Chris Hawblitzel Jon Howell Jacob R. Lorch Oded Padon and Bryan Parno. 2024. Verus: A Practical Foundation for Systems Verification. In Proceedings of the 30th Symposium on Operating Systems Principles SOSP 2024 Hilton Austin Texas USA November 4-6 2024. ACM. https:\/\/sigops.Org\/s\/conferences\/sosp\/2024\/accepted.html","DOI":"10.1145\/3694715.3695952"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3586037"},{"key":"e_1_3_1_27_2","unstructured":"Hayley LeBlanc Jacob R Lorch Chris Hawblitzel Cheng Huang Yiheng Tao Nickolai Zeldovich and Vijay Chidambaram. 2025. PoWER Never Corrupts: Tool-Agnostic Verification of Crash Consistency and Corruption Detection. In OSDI (to appear) (2025)."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17511-4_20"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2404.09939"},{"key":"e_1_3_1_30_2","unstructured":"Jiawei Liu Chunqiu Steven Xia Yuyao Wang and Lingming Zhang. 2023. Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generation. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023 NeurIPS 2023 New Orleans LA USA December 10 - 16 2023. http:\/\/papers.nips.cc\/paper_files\/paper\/2023\/hash\/43e9d647ccd3e4b7b5baab53f0368686-Abstract-Conference.html"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2406.08467"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523704"},{"key":"e_1_3_1_33_2","unstructured":"Microsoft. 2024. Storage systems with verified correctness properties. https:\/\/github.com\/microsoft\/verified-storage. [Online] [Accessed: 2024-09-01]."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3643763"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","unstructured":"Eric Mugnier Emmanuel Anaya Gonzalez Ranjit Jhala Nadia Polikarpova and Yuanyuan Zhou. 2024. Laurel: Generating Dafny Assertions Using Large Language Models. CoRR. abs\/2405.16792. https:\/\/doi.org\/10.48550\/ARXIV.2405.16792 10.48550\/ARXIV.2405.16792","DOI":"10.48550\/ARXIV.2405.16792"},{"key":"e_1_3_1_36_2","unstructured":"Office of the National Cyber Director. 2024. BACK TO THE BUILDING BLOCKS: A PATH TOWARD SECURE AND MEASURABLE SOFTWARE. https:\/\/www.whitehouse.gov\/wp-content\/uploads\/2024\/02\/Final-ONCD-Technical-Report.pdf"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFB0030541"},{"key":"e_1_3_1_38_2","unstructured":"Stanislas Polu and Ilya Sutskever. 2020. Generative Language Modeling for Automated Theorem Proving. CoRR. abs\/2009.03393 (2020). https:\/\/arxiv.org\/abs\/2009.03393"},{"key":"e_1_3_1_39_2","unstructured":"MIT Technology Review. 2023. How Rust went from a side project to the world\u2019s most-loved programming language. https:\/\/www.technologyreview.com\/2023\/02\/14\/1067869\/rust-worlds-fastest-growing-programming-language\/. [Online] [Accessed: 2024-09-01]."},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394450.3397466"},{"key":"e_1_3_1_41_2","unstructured":"Stackoverflow. 2024. \u201c2024 Developer Survey: AI tools at development process; Challenges with AI at work\u201d https:\/\/survey.stackoverflow.co\/2024\/ai\/. [Online] [Accessed: 2025-03-01]."},{"key":"e_1_3_1_42_2","unstructured":"Stackoverflow. 2024. \u201cRust continues to be the most-admired programming language\u201d. https:\/\/survey.stackoverflow.co\/2024\/technology. [Online] [Accessed: 2024-09-01]."},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-65112-0_7"},{"key":"e_1_3_1_44_2","first-page":"649","volume-title":"18th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2024, Santa Clara, CA, USA, July 10-12, 2024","author":"Sun Xudong","year":"2024","unstructured":"Xudong Sun, Wenjie Ma, Jiawei Tyler Gu, Zicheng Ma, Tej Chajed, Jon Howell, Andrea Lattuada, Oded Padon, Lalith Suresh, Adriana Szekeres, and Tianyin Xu. 2024. Anvil: Verifying Liveness of Cluster Management Controllers. In 18th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2024, Santa Clara, CA, USA, July 10-12, 2024. USENIX Association, 649\u2013666. https:\/\/www.usenix.org\/conference\/osdi24\/presentation\/sun-xudong"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837655"},{"key":"e_1_3_1_46_2","unstructured":"The Kani Team. 2024. How Open Source Projects are Using Kani to Write Better Software in Rust | AWS Open Source Blog. https:\/\/aws.amazon.com\/blogs\/opensource\/how-open-source-projects-are-using-kani-to-write-better-software-in-rust\/. [Online] [Accessed: 2024-09-01]."},{"key":"e_1_3_1_47_2","doi-asserted-by":"crossref","unstructured":"Runchu Tian Yining Ye Yujia Qin Xin Cong Yankai Lin Yinxu Pan Yesai Wu Haotian Hui Weichuan Liu Zhiyuan Liu and Maosong Sun. 2024. DebugBench: Evaluating Debugging Capability of Large Language Models.(2024) 4173\u20134198. https:\/\/aclanthology.org\/2024.findings-acl.247","DOI":"10.18653\/v1\/2024.findings-acl.247"},{"key":"e_1_3_1_48_2","unstructured":"Verus. [n. d.]. Verus Tutorial and Reference. https:\/\/verus-lang.github.io\/verus\/guide\/"},{"key":"e_1_3_1_49_2","volume-title":"The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024","author":"Wang Haiming","year":"2024","unstructured":"Haiming Wang, Huajian Xin, Chuanyang Zheng, Zhengying Liu, Qingxing Cao, Yinya Huang, Jing Xiong, Han Shi, Enze Xie, Jian Yin, Zhenguo Li, and Xiaodan Liang. 2024. LEGO-Prover: Neural Theorem Proving with Growing Libraries. In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024. OpenReview.net. https:\/\/openreview.net\/forum?id=3f5PALef5B"},{"key":"e_1_3_1_50_2","volume-title":"The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024","author":"Wu Haoze","year":"2024","unstructured":"Haoze Wu, Clark W. Barrett, and Nina Narodytska. 2024. Lemur: Integrating Large Language Models in Automated Program Verification. In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024. OpenReview.net. https:\/\/openreview.net\/forum?id=Q3YaCghZNt"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","unstructured":"Chunqiu Steven Xia and Lingming Zhang. 2023. Keep the Conversation Going: Fixing 162 out of 337 bugs for $0.42 each using ChatGPT. CoRR. abs\/2304.00385 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2304.00385 10.48550\/ARXIV.2304.00385","DOI":"10.48550\/ARXIV.2304.00385"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","unstructured":"Chenyuan Yang. 2025. Artifact of \u201cAutoVerus: Automated Proof Generation for Rust Code\u201d in OOPSLA 2025. https:\/\/doi.org\/10.5281\/zenodo.16891950 10.5281\/zenodo.16891950","DOI":"10.5281\/zenodo.16891950"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3689736"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3676641.3716022"},{"key":"e_1_3_1_55_2","first-page":"6984","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research, Vol. 97)","author":"Yang Kaiyu","year":"2019","unstructured":"Kaiyu Yang and Jia Deng. 2019. Learning to Prove Theorems via Interacting with Proof Assistants. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research, Vol. 97). PMLR, 6984\u20136994. http:\/\/proceedings.mlr.press\/v97\/yangl9a.html"},{"key":"e_1_3_1_56_2","unstructured":"Kaiyu Yang Aidan M. Swope Alex Gu Rahul Chalamala Peiyang Song Shixing Yu Saad Godil Ryan J. Prenger and Animashree Anandkumar. 2023. LeanDojo: Theorem Proving with Retrieval-Augmented Language Models. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023 NeurIPS 2023 New Orleans LA USA December 10-16 2023. http:\/\/papers.nips.ee\/paper_files\/paper\/2023\/hash\/4441469427094f8873d0fecb0c4elcee-Abstract-Datasets_and_Benchmarks.html"},{"key":"e_1_3_1_57_2","first-page":"599","volume-title":"18th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2024, Santa Clara, CA, USA, July 10-12, 2024","author":"Zhou Ziqiao","year":"2024","unstructured":"Ziqiao Zhou, Anjali , Weiteng Chen, Sishuai Gong, Chris Hawblitzel, and Weidong Cui. 2024. VeriSMo: A Verified Security Module for Confidential VMs. In 18th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2024, Santa Clara, CA, USA, July 10-12, 2024. USENIX Association, 599\u2013614. https:\/\/www.usenix.org\/conference\/osdi24\/presentation\/zhou"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3763174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:01:33Z","timestamp":1784196093000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3763174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,9]]},"references-count":56,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2025,10,9]]}},"alternative-id":["10.1145\/3763174"],"URL":"https:\/\/doi.org\/10.1145\/3763174","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,9]]},"assertion":[{"value":"2025-03-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}