{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T17:45:03Z","timestamp":1794591903439,"version":"4.9.1"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","license":[{"start":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:00:00Z","timestamp":1759968000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2131476,CCF-2318974,CCF-2219995,CNS-2245344"],"award-info":[{"award-number":["CCF-2131476,CCF-2318974,CCF-2219995,CNS-2245344"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"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>Zero-knowledge (ZK) protocols enable software developers to provide proofs of their programs\u2019 correctness to other parties without revealing the programs themselves. Regular expressions are pervasive in real-world software, and zero-knowledge protocols have been developed in the past for the problem of checking whether an individual string appears in the language of a regular expression, but no existing protocol addresses the more complex PSPACE-complete problem of proving that two regular expressions are equivalent.<\/jats:p>\n                  <jats:p>\n                    We introduce\n                    <jats:monospace>Cr\u00eape<\/jats:monospace>\n                    , the first ZK protocol for encoding regular expression equivalence proofs and also the first ZK protocol to target a PSPACE-complete problem.\n                    <jats:monospace>Cr\u00eape<\/jats:monospace>\n                    uses a custom calculus of proof rules based on regular expression derivatives and coinduction, and we introduce a sound and complete algorithm for generating proofs in our format. We test\n                    <jats:monospace>Cr\u00eape<\/jats:monospace>\n                    on a suite of hundreds of regular expression equivalence proofs.\n                    <jats:monospace>Cr\u00eape<\/jats:monospace>\n                    can validate large proofs in only a few seconds each.\n                  <\/jats:p>","DOI":"10.1145\/3763063","type":"journal-article","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T08:49:50Z","timestamp":1759999790000},"page":"357-385","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6084-2387","authenticated-orcid":false,"given":"John C.","family":"Kolesar","sequence":"first","affiliation":[{"name":"Yale University, New Haven, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7870-6727","authenticated-orcid":false,"given":"Shan","family":"Ali","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9654-4090","authenticated-orcid":false,"given":"Timos","family":"Antonopoulos","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3267-0776","authenticated-orcid":false,"given":"Ruzica","family":"Piskac","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,10,9]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/3ICT.2019.8910291"},{"key":"e_1_3_2_3_2","first-page":"255","article-title":"Algorithms for finding patterns in strings","volume":"1","author":"Aho Alfred V.","year":"2014","unstructured":"Alfred V. Aho. 2014. Algorithms for finding patterns in strings. Algorithms and Complexity 1 (2014), 255.","journal-title":"Algorithms and Complexity"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70844-5_6"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.3.4"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535862"},{"key":"e_1_3_2_7_2","unstructured":"Sebastian Angel Eleftherios Ioannidis Elizabeth Margolin Srinath Setty and Jess Woods. 2024. Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs. In 33rd USENIX Security Symposium (USENIX Security 24). 3801\u20133818. https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/angel"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)80010-7"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3571213"},{"key":"e_1_3_2_10_2","first-page":"92","volume-title":"Annual International Cryptology Conference","author":"Baum Carsten","year":"2021","unstructured":"Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, and Peter Scholl. 2021. Mac\u2019 n\u2019 Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. In Annual International Cryptology Conference. Springer, 92\u2013122."},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_12_2","unstructured":"@bergmannjg. 2025. Regex | Reservoir. https:\/\/reservoir.lean-lang.org\/@bergmannjg\/Regex. Accessed: 2025-07-08."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81688-9_14"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA201015"},{"key":"e_1_3_2_15_2","unstructured":"Nikolaj Bj\u00f8rner. 2024. Private communication."},{"key":"e_1_3_2_16_2","unstructured":"Nikolaj Bj\u00f8rner. 2025. Private communication."},{"key":"e_1_3_2_17_2","unstructured":"BlueFalconHD. 2025. apple_generative_model_safety_decrypted\/decrypted_overrides\/com.apple.gm.safety_deny.output.mail_reply.long_form_rewrite.generic\/AssetData\/locale\/es_US\/metadata.jsonatmainBlueFalconHD\/apple_generative_model_safety_decrypted\u00b7GitHub. https:\/\/github.com\/BlueFalconHD\/apple_generative_model_safety_decrypted\/blob\/main\/decrypted_overrides\/com.apple.gm.safety_deny.output.mail_reply.long_form_rewrite.generic\/AssetData\/locale\/es_US\/metadata.json. Accessed: 2025-07-06."},{"key":"e_1_3_2_18_2","unstructured":"BlueFalconHD. 2025. GitHub - BlueFalconHD\/apple_generative_model_safety_decrypted: Decrypted Generative Model safety files for Apple Intelligence containing filters. https:\/\/github.com\/BlueFalconHD\/apple_generative_model_safety_decrypted\/tree\/main. Accessed: 2025-07-06."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/0220068"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185352"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","unstructured":"Benjamin Braun Ariel J. Feldman Zuocheng Ren Srinath Setty Andrew J. Blumberg and Michael Walfish. 2013. Verifying computations with state. In Proceedings of the twenty-fourth ACM Symposium on Operating Systems Principles. 341\u2013357. https:\/\/doi.org\/10.1145\/2517349.2522733 10.1145\/2517349.2522733","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/IRETELC.1962.5407917"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"e_1_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Diego Calvanese Giuseppe De Giacomo Maurizio Lenzerini and Moshe Y. Vardi. 1999. Rewriting of regular expressions and regular path queries. In Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. 194\u2013204.","DOI":"10.1145\/303976.303996"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_26_2","first-page":"6997","article-title":"Regulating algorithmic filtering on social media","volume":"34","author":"Cen Sarah","year":"2021","unstructured":"Sarah Cen and Devavrat Shah. 2021. Regulating algorithmic filtering on social media. Advances in Neural Information Processing Systems 34(2021), 6997\u20137011.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31759-0_19"},{"key":"e_1_3_2_28_2","unstructured":"Microsoft Corporation. 2024. Regular Expressions | Online Z3 Guide. https:\/\/microsoft.github.io\/z3guide\/docs\/theories\/Regular%20Expressions\/. Accessed: 2024-09-02."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/12.2.301"},{"key":"e_1_3_2_30_2","first-page":"6525","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Cu\u00e9llar Santiago","year":"2023","unstructured":"Santiago Cu\u00e9llar, Bill Harris, James Parker, Stuart Pernsteiner, and Eran Tromer. 2023. Cheesecloth: Zero-Knowledge Proofs of Real World Vulnerabilities. In 32nd USENIX Security Symposium (USENIX Security 23). USENIX Association, Anaheim, CA, 6525\u20136540. https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/cuellar"},{"key":"e_1_3_2_31_2","first-page":"63","volume-title":"School organized by the European Educational Forum","author":"Damg\u00e5rd Ivan","year":"1998","unstructured":"Ivan Damg\u00e5rd. 1998. Commitment schemes and zero-knowledge protocols. In School organized by the European Educational Forum. Springer, 63\u201386."},{"key":"e_1_3_2_32_2","first-page":"123","volume-title":"LPAR Workshops","author":"de Moura Leonardo Mendon\u00e7a","year":"2008","unstructured":"Leonardo Mendon\u00e7a de Moura and Nikolaj S. Bj\u00f8rner. 2008. Proofs and Refutations, and Z3. In LPAR Workshops, Vol. 418. Doha, Qatar, 123\u2013132."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48184-2_5"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14791-3_27"},{"key":"e_1_3_2_35_2","volume-title":"2nd Conference on Information-Theoretic Cryptography (ITC 2021) (Leibniz International Proceedings in Informatics (LIPIcs)). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","author":"Dittmer Samuel","year":"2021","unstructured":"Samuel Dittmer, Yuval Ishai, and Rafail Ostrovsky. 2021. Line-Point Zero Knowledge and Its Applications. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021) (Leibniz International Proceedings in Informatics (LIPIcs)). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","unstructured":"Chiara Patricia Drolsbach and Nicolas Pr\u00f6llochs. 2024. Content moderation on social media in the EU: insights from the DSA transparency database. In Companion Proceedings of the ACM Web Conference 2024. 939\u2013942. https:\/\/doi.org\/10.1145\/3589335.3651482 10.1145\/3589335.3651482","DOI":"10.1145\/3589335.3651482"},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Nate Foster Dexter Kozen Mae Milano Alexandra Silva and Laure Thompson. 2015. A coalgebraic decision procedure for NetKAT. In Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 343\u2013355.","DOI":"10.1145\/2676726.2677011"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484800"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9389-0"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-761"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_42_2","first-page":"291","volume-title":"17th ACM STOC","author":"Goldwasser Shafi","year":"1985","unstructured":"Shafi Goldwasser, Silvio Micali, and Chales Rackoff. 1985. The knowledge complexity of interactive proof-systems (extended abstract). In 17th ACM STOC. ACM Press, 291\u2013304."},{"key":"e_1_3_2_43_2","doi-asserted-by":"crossref","unstructured":"Michael Greenberg Ryan Beckett and Eric Campbell. 2022. Kleene algebra modulo theories: a framework for concrete KATs. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. 594\u2013608.","DOI":"10.1145\/3519939.3523722"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417283"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80027-9"},{"key":"e_1_3_2_46_2","doi-asserted-by":"crossref","unstructured":"John Kolesar Shan Ali Timos Antonopoulos and Ruzica Piskac. 2025. Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge. arXiv preprint arXiv:2504.01198 (2025).","DOI":"10.1145\/3763063"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","unstructured":"John C. Kolesar Shan Ali Timos Antonopoulos and Ruzica Piskac. 2025. Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge: Artifact. https:\/\/doi.org\/10.5281\/zenodo.16916368 10.5281\/zenodo.16916368","DOI":"10.5281\/zenodo.16916368"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/256167.256195"},{"key":"e_1_3_2_49_2","unstructured":"Dexter Kozen. 2002. On Hoare logic Kleene algebra and types. SYNTHESE LIBRARY (2002) 119\u2013136."},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","unstructured":"Dexter Kozen and Maria-Christina Patron. 2000. Certification of Compiler Optimizations Using Kleene Algebra with Tests. In Computational Logic. https:\/\/api.semanticscholar.org\/CorpusID:17109057","DOI":"10.1007\/3-540-44957-4_38"},{"key":"e_1_3_2_51_2","volume-title":"Automatically Testing Solvers for String and Regular Expressions Constraints","author":"K\u00fchne Sebastian","year":"2021","unstructured":"Sebastian K\u00fchne. 2021. Automatically Testing Solvers for String and Regular Expressions Constraints. Bachelor\u2019s Thesis. Swiss Federal Institute of Technology Zurich."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","unstructured":"Evan Laufer Alex Ozdemir and Dan Boneh. 2024. Zkpi: Proving lean theorems in zero-knowledge. In Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. 4301\u20134315. https:\/\/doi.org\/10.1145\/3658644.3670322 10.1145\/3658644.3670322","DOI":"10.1145\/3658644.3670322"},{"key":"e_1_3_2_53_2","unstructured":"Xavier Leroy Sandrine Blazy Daniel K\u00e4stner Bernhard Schommer Markus Pister and Christian Ferdinand. 2016. CompCert-a formally verified optimizing compiler. In ERTS."},{"key":"e_1_3_2_54_2","unstructured":"Yeting Li Zixuan Chen Jialun Cao Zhiwu Xu Qiancheng Peng Haiming Chen Liyuan Chen and Shing-Chi Cheung. 2021. ReDoSHunter: A combined static and dynamic approach for regular expression DoS detection. In 30th USENIX Security Symposium (USENIX Security 21). 3847\u20133864."},{"key":"e_1_3_2_55_2","doi-asserted-by":"crossref","unstructured":"Yeting Li Zhiwu Xu Jialun Cao Haiming Chen Tingjian Ge Shing-Chi Cheung and Haoren Zhao. 2020. FlashRegex: deducing anti-ReDoS regexes from examples. In Proceedings of the 35th IEEE\/ACM International Conference on Automated Software Engineering. 659\u2013671.","DOI":"10.1145\/3324884.3416556"},{"key":"e_1_3_2_56_2","unstructured":"Daniel Luick John C. Kolesar Timos Antonopoulos William R. Harris James Parker Ruzica Piskac Eran Tromer Xiao Wang and Ning Luo. 2024. ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge. In 33rd USENIX Security Symposium (USENIX Security 24). 3837\u20133845."},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559373"},{"key":"e_1_3_2_58_2","doi-asserted-by":"crossref","unstructured":"Ning Luo Chenkai Weng Jaspal Singh Gefei Tan Ruzica Piskac and Mariana Raykova. 2023. Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata. Cryptology ePrint Archive (2023).","DOI":"10.1007\/978-3-031-70890-9_12"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620718"},{"key":"e_1_3_2_60_2","doi-asserted-by":"crossref","unstructured":"George C. Necula. 2000. Translation validation for an optimizing compiler. In ACM SIGPLAN.","DOI":"10.1145\/349299.349314"},{"key":"e_1_3_2_61_2","unstructured":"@pandaman64. 2025. Lean-regex | Reservoir. https:\/\/reservoir.lean-lang.org\/@pandaman64\/lean-regex. Accessed: 2025-07-08."},{"key":"e_1_3_2_62_2","doi-asserted-by":"crossref","unstructured":"Amir Pnueli Michael Siegel and Eli Singerman. 1998. Translation validation. In TACAS.","DOI":"10.1007\/BFb0054170"},{"key":"e_1_3_2_63_2","doi-asserted-by":"crossref","unstructured":"Michael Raymond Gillian Evers Jan Ponti Diya Krishnan and Xiang Fu. 2023. Efficient Zero Knowledge for Regular Language. Cryptology ePrint Archive (2023).","DOI":"10.1007\/978-3-031-64948-6_19"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom60117.2023.00123"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/1516507.1516510"},{"key":"e_1_3_2_66_2","doi-asserted-by":"crossref","unstructured":"Adi Shamir. 1992. Ip = pspace. Journal of the ACM ( JACM) 39 4 (1992) 869\u2013877.","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_67_2","doi-asserted-by":"crossref","unstructured":"Robin Sommer and Vern Paxson. 2003. Enhancing byte-level network intrusion detection signatures with context. In Proceedings of the 10th ACM conference on Computer and communications security. 262\u2013271.","DOI":"10.1145\/948109.948145"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1137\/0214044"},{"key":"e_1_3_2_69_2","doi-asserted-by":"crossref","unstructured":"Larry J. Stockmeyer and Albert R. Meyer. 1973. Word problems requiring exponential time (preliminary report). In Proceedings of the fifth annual ACM symposium on Theory of computing. 1\u20139.","DOI":"10.1145\/800125.804029"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.204"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23097"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484556"},{"key":"e_1_3_2_74_2","doi-asserted-by":"crossref","unstructured":"Yibin Yang David Heath Carmit Hazay Vladimir Kolesnikov and Muthuramakrishnan Venkitasubramaniam. 2023. Batchman and robin: Batched and non-batched branching for interactive zk. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security. 1452\u20131466.","DOI":"10.1145\/3576915.3623169"},{"key":"e_1_3_2_75_2","doi-asserted-by":"crossref","unstructured":"Yibin Yang David Heath Carmit Hazay Vladimir Kolesnikov and Muthuramakrishnan Venkitasubramaniam. 2024. Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction. Cryptology ePrint Archive (2024).","DOI":"10.1145\/3658644.3690289"},{"key":"e_1_3_2_76_2","unstructured":"Collin Zhang Zachary DeStefano Arasu Arun Joseph Bonneau Paul Grubbs and Michael Walfish. 2024. Zombie: Middleboxes that Don\u2019t Snoop. In 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24). 1917\u20131936."},{"key":"e_1_3_2_77_2","unstructured":"Zhipeng Zhao Hugo Sadok Nirav Atre James C. Hoe Vyas Sekar and Justine Sherry. 2020. Achieving 100gbps intrusion prevention on a single server. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 1083\u20131100."},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-016-0263-6"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3763063","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3763063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:04:30Z","timestamp":1784196270000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3763063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,9]]},"references-count":77,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2025,10,9]]}},"alternative-id":["10.1145\/3763063"],"URL":"https:\/\/doi.org\/10.1145\/3763063","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,9]]},"assertion":[{"value":"2025-03-25","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"}}]}}