{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:54:36Z","timestamp":1773194076936,"version":"3.50.1"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1749571,2232339"],"award-info":[{"award-number":["1749571,2232339"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["V-SPELLS"],"award-info":[{"award-number":["V-SPELLS"]}],"id":[{"id":"10.13039\/100000185","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":[[2023,10,16]]},"abstract":"<jats:p>Rewrite rules are critical in equality saturation, an increasingly popular technique  \nin optimizing compilers, synthesizers, and verifiers. Unfortunately,  \ndeveloping high-quality rulesets is difficult and error-prone. Recent  \nwork on automatically inferring rewrite rules does not scale to large  \nterms or grammars, and existing rule inference tools are monolithic and  \nopaque. Equality saturation users therefore struggle to guide inference and  \nincrementally construct rulesets. As a result, most users still  \nmanually develop and maintain rulesets.<\/jats:p>\n          <jats:p>This paper proposes Enumo, a new domain-specific language for  \nprogrammable theory exploration. Enumo provides a small set of core  \noperators that enable users to strategically guide rule inference and  \nincrementally build rulesets. Short Enumo programs easily replicate  \nresults from state-of-the-art tools, but Enumo programs can also scale  \nto infer deeper rules from larger grammars than prior approaches. Its  \ncomposable operators even facilitate developing new strategies for  \nruleset inference. We introduce a new fast-forwarding strategy that does not require  \nevaluating terms in the target language, and can thus support domains  \nthat were out of scope for prior work.<\/jats:p>\n          <jats:p>We evaluate Enumo and fast-forwarding across a variety of domains. Compared to  \nstate-of-the-art techniques, enumo can synthesize better rulesets over a  \ndiverse set of domains, in some cases matching the effects of  \nmanually-developed rulesets in systems driven by equality saturation.<\/jats:p>","DOI":"10.1145\/3622834","type":"journal-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T15:41:29Z","timestamp":1697470889000},"page":"1034-1062","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Equality Saturation Theory Exploration \u00e0 la Carte"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0692-0707","authenticated-orcid":false,"given":"Anjali","family":"Pal","sequence":"first","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3482-5767","authenticated-orcid":false,"given":"Brett","family":"Saiki","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0731-5398","authenticated-orcid":false,"given":"Ryan","family":"Tjoa","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4456-9406","authenticated-orcid":false,"given":"Cynthia","family":"Richey","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5766-7090","authenticated-orcid":false,"given":"Amy","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0656-235X","authenticated-orcid":false,"given":"Oliver","family":"Flatt","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8066-4218","authenticated-orcid":false,"given":"Max","family":"Willsey","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4731-0124","authenticated-orcid":false,"given":"Zachary","family":"Tatlock","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8633-8413","authenticated-orcid":false,"given":"Chandrakana","family":"Nandi","sequence":"additional","affiliation":[{"name":"Certora, Seattle, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Foundations of Databases","author":"Abiteboul Serge","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases . Addison-Wesley . isbn:0-201-53771-0 http:\/\/webdam.inria.fr\/Alice\/ Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. isbn:0-201-53771-0 http:\/\/webdam.inria.fr\/Alice\/"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168906"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032319"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386037"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520308.3534506"},{"key":"e_1_2_1_6_1","volume-title":"Optgen: A Generator for Local Optimizations","author":"Buchwald Sebastian","year":"2015","unstructured":"Sebastian Buchwald . 2015 . Optgen: A Generator for Local Optimizations . In Compiler Construction, Bj\u00f6rn Franke (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg . 171\u2013189. isbn:978-3-662-46663-6 Sebastian Buchwald. 2015. Optgen: A Generator for Local Optimizations. In Compiler Construction, Bj\u00f6rn Franke (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 171\u2013189. isbn:978-3-662-46663-6"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3168821"},{"key":"e_1_2_1_8_1","volume-title":"Automatic Generation of Procedural Knowledge Using Program Synthesis. Ph. D. Dissertation","author":"Butler Eric","unstructured":"Eric Butler . 2019. Automatic Generation of Procedural Knowledge Using Program Synthesis. Ph. D. Dissertation . University of Washington , USA. https:\/\/hdl.handle.net\/1773\/43656 Eric Butler. 2019. Automatic Generation of Procedural Knowledge Using Program Synthesis. Ph. D. Dissertation. University of Washington, USA. https:\/\/hdl.handle.net\/1773\/43656"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571207"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3022670.2951949"},{"key":"e_1_2_1_11_1","volume-title":"Automated Deduction \u2013 CADE-24","author":"Claessen Koen","unstructured":"Koen Claessen , Moa Johansson , Dan Ros\u00e9n , and Nicholas Smallbone . 2013. Automating Inductive Proofs Using Theory Exploration . In Automated Deduction \u2013 CADE-24 , Maria Paola Bonacina (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg . 392\u2013406. isbn:978-3-642-38574-2 Koen Claessen, Moa Johansson, Dan Ros\u00e9n, and Nicholas Smallbone. 2013. Automating Inductive Proofs Using Theory Exploration. In Automated Deduction \u2013 CADE-24, Maria Paola Bonacina (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 392\u2013406. isbn:978-3-642-38574-2"},{"key":"e_1_2_1_12_1","volume-title":"QuickSpec: Guessing Formal Specifications Using Testing","author":"Claessen Koen","unstructured":"Koen Claessen , Nicholas Smallbone , and John Hughes . 2010. QuickSpec: Guessing Formal Specifications Using Testing . In Tests and Proofs, Gordon Fraser and Angelo Gargantini (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 6\u201321. isbn:978-3-642-13977-2 Koen Claessen, Nicholas Smallbone, and John Hughes. 2010. QuickSpec: Guessing Formal Specifications Using Testing. In Tests and Proofs, Gordon Fraser and Angelo Gargantini (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 6\u201321. isbn:978-3-642-13977-2"},{"key":"e_1_2_1_13_1","unstructured":"Coq. 2022. Library Coq.PArith.BinPos.  https:\/\/coq.inria.fr\/library\/Coq.PArith.BinPos.html \t\t\t\t  Coq. 2022. Library Coq.PArith.BinPos.  https:\/\/coq.inria.fr\/library\/Coq.PArith.BinPos.html"},{"key":"e_1_2_1_14_1","unstructured":"Samuel Coward George A. Constantinides and Theo Drane. 2022. Abstract Interpretation on E-Graphs. arxiv:2203.09191. \t\t\t\t  Samuel Coward George A. Constantinides and Theo Drane. 2022. Abstract Interpretation on E-Graphs. arxiv:2203.09191."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Samuel Coward George A. Constantinides and Theo Drane. 2023. Automating Constraint-Aware Datapath Optimization using E-Graphs. arxiv:2303.01839. \t\t\t\t  Samuel Coward George A. Constantinides and Theo Drane. 2023. Automating Constraint-Aware Datapath Optimization using E-Graphs. arxiv:2303.01839.","DOI":"10.1109\/DAC56929.2023.10247797"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/989393.989407"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_2_1_18_1","volume-title":"Bj\u00f8rner","author":"de Moura Leonardo Mendon\u00e7a","year":"2007","unstructured":"Leonardo Mendon\u00e7a de Moura and Nikolaj S . Bj\u00f8rner . 2007 . Efficient E-Matching for SMT Solvers. In CADE. Leonardo Mendon\u00e7a de Moura and Nikolaj S. Bj\u00f8rner. 2007. Efficient E-Matching for SMT Solvers. In CADE."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066102"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364506.2364515"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1995.1070"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3559009.3569673"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ECOOP.2022.13"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359630"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10817-010-9193-y","article-title":"Conjecture Synthesis for Inductive Theories","volume":"47","author":"Johansson Moa","year":"2010","unstructured":"Moa Johansson , L. Dixon , and A. Bundy . 2010 . Conjecture Synthesis for Inductive Theories . Journal of Automated Reasoning , 47 (2010), 251 \u2013 289 . Moa Johansson, L. Dixon, and A. Bundy. 2010. Conjecture Synthesis for Inductive Theories. Journal of Automated Reasoning, 47 (2010), 251\u2013289.","journal-title":"Journal of Automated Reasoning"},{"key":"e_1_2_1_26_1","volume-title":"Hipster: Integrating Theory Exploration in a Proof Assistant","author":"Johansson Moa","year":"2014","unstructured":"Moa Johansson , Dan Ros\u00e9n , Nicholas Smallbone , and Koen Claessen . 2014 . Hipster: Integrating Theory Exploration in a Proof Assistant . In Intelligent Computer Mathematics, Stephen M. Watt, James H. Davenport, Alan P. Sexton, Petr Sojka, and Josef Urban (Eds.). Springer International Publishing , Cham . 108\u2013122. isbn:978-3-319-08434-3 Moa Johansson, Dan Ros\u00e9n, Nicholas Smallbone, and Koen Claessen. 2014. Hipster: Integrating Theory Exploration in a Proof Assistant. In Intelligent Computer Mathematics, Stephen M. Watt, James H. Davenport, Alan P. Sexton, Petr Sojka, and Josef Urban (Eds.). Springer International Publishing, Cham. 108\u2013122. isbn:978-3-319-08434-3"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/543552.512566"},{"key":"e_1_2_1_28_1","volume-title":"Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations in Languages with Bindings. ArXiv, abs\/2111.13040","author":"Koehler Thomas","year":"2021","unstructured":"Thomas Koehler , Philip W. Trinder , and Michel Steuwer . 2021. Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations in Languages with Bindings. ArXiv, abs\/2111.13040 ( 2021 ). Thomas Koehler, Philip W. Trinder, and Michel Steuwer. 2021. Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations in Languages with Bindings. ArXiv, abs\/2111.13040 (2021)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803406"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563348"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563348"},{"key":"e_1_2_1_32_1","volume-title":"Belviranli","author":"McClurg Jedidiah","year":"2021","unstructured":"Jedidiah McClurg , Miles Claver , Jackson Garner , Jake Vossen , Jordan Schmerge , and Mehmet E . Belviranli . 2021 . Optimizing Regular Expressions via Rewrite-Guided Synthesis . https:\/\/doi.org\/10.48550\/ARXIV.2104.12039 10.48550\/ARXIV.2104.12039 Jedidiah McClurg, Miles Claver, Jackson Garner, Jake Vossen, Jordan Schmerge, and Mehmet E. Belviranli. 2021. Optimizing Regular Expressions via Rewrite-Guided Synthesis. https:\/\/doi.org\/10.48550\/ARXIV.2104.12039"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140587.3062372"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236794"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386012"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485496"},{"key":"e_1_2_1_37_1","volume-title":"Techniques for Program Verification. Ph. D. Dissertation","author":"Nelson Charles Gregory","unstructured":"Charles Gregory Nelson . 1980. Techniques for Program Verification. Ph. D. Dissertation . Stanford University . Stanford, CA, USA. AAI8011683 Charles Gregory Nelson. 1980. Techniques for Program Verification. Ph. D. Dissertation. Stanford University. Stanford, CA, USA. AAI8011683"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the ACM on Programming Languages.","author":"Newcomb Julie L.","year":"2020","unstructured":"Julie L. Newcomb , Steven Johnson , Shoaib Kamil , Andrew Adams , and Ratislav Bodik . 2020 . Verifying and Improving Halide\u2019s Term Rewriting System with Program Synthesis . Proceedings of the ACM on Programming Languages. Julie L. Newcomb, Steven Johnson, Shoaib Kamil, Andrew Adams, and Ratislav Bodik. 2020. Verifying and Improving Halide\u2019s Term Rewriting System with Program Synthesis. Proceedings of the ACM on Programming Languages."},{"key":"e_1_2_1_39_1","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT","author":"N\u00f6tzli Andres","year":"2019","unstructured":"Andres N\u00f6tzli , Andrew Reynolds , Haniel Barbosa , Aina Niemetz , Mathias Preiner , Clark Barrett , and Cesare Tinelli . 2019. Syntax-Guided Rewrite Rule Enumeration for SMT Solvers . In Theory and Applications of Satisfiability Testing \u2013 SAT 2019 , Mikol\u00e1\u0161 Janota and In\u00eas Lynce (Eds.). Springer International Publishing , Cham. 279\u2013297. isbn:978-3-030-24258-9 Andres N\u00f6tzli, Andrew Reynolds, Haniel Barbosa, Aina Niemetz, Mathias Preiner, Clark Barrett, and Cesare Tinelli. 2019. Syntax-Guided Rewrite Rule Enumeration for SMT Solvers. In Theory and Applications of Satisfiability Testing \u2013 SAT 2019, Mikol\u00e1\u0161 Janota and In\u00eas Lynce (Eds.). Springer International Publishing, Cham. 279\u2013297. isbn:978-3-030-24258-9"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2737959"},{"key":"e_1_2_1_41_1","volume-title":"Function representation in geometric modeling: concepts, implementation and applications. The visual computer, 11","author":"Pasko Alexander","year":"1995","unstructured":"Alexander Pasko , Valery Adzhiev , Alexei Sourin , and Vladimir Savchenko . 1995. Function representation in geometric modeling: concepts, implementation and applications. The visual computer, 11 ( 1995 ), 429\u2013446. Alexander Pasko, Valery Adzhiev, Alexei Sourin, and Vladimir Savchenko. 1995. Function representation in geometric modeling: concepts, implementation and applications. The visual computer, 11 (1995), 429\u2013446."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(86)90015-4"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386001"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462176"},{"key":"e_1_2_1_45_1","volume-title":"Approaches and Applications of Inductive Programming","author":"Yakushev Alexey Rodriguez","year":"1931","unstructured":"Alexey Rodriguez Yakushev and Johan Jeuring . 2010. Enumerating Well-Typed Terms Generically . In Approaches and Applications of Inductive Programming , Ute Schmid, Emanuel Kitzelmann, and Rinus Plasmeijer (Eds.). Springer Berlin Heidelberg, Berlin , Heidelberg . 93\u2013116. isbn:978-3-642-1 1931 -6 Alexey Rodriguez Yakushev and Johan Jeuring. 2010. Enumerating Well-Typed Terms Generically. In Approaches and Applications of Inductive Programming, Ute Schmid, Emanuel Kitzelmann, and Rinus Plasmeijer (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 93\u2013116. isbn:978-3-642-11931-6"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2016.7886678"},{"key":"e_1_2_1_47_1","volume-title":"Deep Reinforcement Learning for Equality Saturation","author":"Singh Zak","year":"2022","unstructured":"Zak Singh . 2022. Deep Reinforcement Learning for Equality Saturation . University of Cambridge , https:\/\/www.cl.cam.ac.uk\/ ey204\/pubs\/MPHIL_P3\/ 2022 _Zak.pdf Zak Singh. 2022. Deep Reinforcement Learning for Equality Saturation. University of Cambridge, https:\/\/www.cl.cam.ac.uk\/ ey204\/pubs\/MPHIL_P3\/2022_Zak.pdf"},{"key":"e_1_2_1_48_1","volume-title":"Theory Exploration Powered by Deductive Synthesis","author":"Singher Eytan","unstructured":"Eytan Singher and Shachar Itzhaky . 2021. Theory Exploration Powered by Deductive Synthesis . In Computer Aided Verification, Alexandra Silva and K. Rustan M. Leino (Eds.). Springer International Publishing , Cham . 125\u2013148. isbn:978-3-030-81688-9 Eytan Singher and Shachar Itzhaky. 2021. Theory Exploration Powered by Deductive Synthesis. In Computer Aided Verification, Alexandra Silva and K. Rustan M. Leino (Eds.). Springer International Publishing, Cham. 125\u2013148. isbn:978-3-030-81688-9"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158097"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480915"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446707"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407799"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526125"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the ACM on Programming Languages.","author":"Willsey Max","year":"2021","unstructured":"Max Willsey , Chandrakana Nandi , Yisu Remy Wang , Oliver Flatt , Zachary Tatlock , and Pavel Panchekha . 2021 . egg: Fast and Extensible Equality Saturation . Proceedings of the ACM on Programming Languages. Max Willsey, Chandrakana Nandi, Yisu Remy Wang, Oliver Flatt, Zachary Tatlock, and Pavel Panchekha. 2021. egg: Fast and Extensible Equality Saturation. Proceedings of the ACM on Programming Languages."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591254"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of Machine Learning and Systems. arxiv:2101","author":"Yang Yichen","year":"2021","unstructured":"Yichen Yang , Phitchaya Mangpo Phothilimtha , Yisu Remy Wang , Max Willsey , Sudip Roy , and Jacques Pienaar . 2021 . Equality Saturation for Tensor Graph Superoptimization . In Proceedings of Machine Learning and Systems. arxiv:2101 .01332. Yichen Yang, Phitchaya Mangpo Phothilimtha, Yisu Remy Wang, Max Willsey, Sudip Roy, and Jacques Pienaar. 2021. Equality Saturation for Tensor Graph Superoptimization. In Proceedings of Machine Learning and Systems. arxiv:2101.01332."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622834","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3622834","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3622834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:04Z","timestamp":1750178224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":56,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2023,10,16]]}},"alternative-id":["10.1145\/3622834"],"URL":"https:\/\/doi.org\/10.1145\/3622834","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"2023-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}