{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T11:58:45Z","timestamp":1790423925723,"version":"4.1.0"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA1","license":[{"start":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:00:00Z","timestamp":1775779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2216987"],"award-info":[{"award-number":["CCF-2216987"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1919197"],"award-info":[{"award-number":["CCF-1919197"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1908504"],"award-info":[{"award-number":["CCF-1908504"]}],"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":[[2026,4,10]]},"abstract":"<jats:p>Dynamic Symbolic Execution (DSE) suffers from the path explosion problem when the target program has many conditional branches. The classical approach for managing the path explosion problem is dynamic state merging. Dynamic state merging combines similar symbolic program states to avoid the exponential growth in the number of states during DSE. However, state merging still requires solver invocations at each program branch, even when both paths of the branch are feasible. Moreover, the best path search strategy for DSE may not create the best state merging opportunities. Some drawbacks of state merging can be mitigated by compile-time state merging (i.e., branch elimination by converting control-flow into dataflow). In this paper, we propose a non-semantics-preserving but failure-preserving compiler transformation for removing expensive symbolic branches in a program to improve the scalability of DSE. We have developed a framework for detecting spurious bugs that our transformation can insert. Finally, we show that our transformation can significantly improve the performance of DSE on various benchmark programs and help improve the performance of coverage and bug discovery of large real-world programs.<\/jats:p>","DOI":"10.1145\/3798202","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T14:33:43Z","timestamp":1775831623000},"page":"59-85","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Taming the Hydra: Targeted Control-Flow Transformations for Dynamic Symbolic Execution"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9900-2804","authenticated-orcid":false,"given":"Charitha","family":"Saumya","sequence":"first","affiliation":[{"name":"Intel, Santa Clara, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2773-7524","authenticated-orcid":false,"given":"Muhammad","family":"Hassan","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7193-0144","authenticated-orcid":false,"given":"Rohan","family":"Gangaraju","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6827-345X","authenticated-orcid":false,"given":"Milind","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6384-062X","authenticated-orcid":false,"given":"Kirshanthan","family":"Sundararajah","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792771"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3182657"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","unstructured":"K. E. Batcher . 1968. Sorting networks and their applications. In Proceedings of the April 30 May 2 1968 spring joint computer conference (AFIPS '68 (Spring)) 307\u2013314. doi:10.1145\/1468075.1468121","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_1_5_1","doi-asserted-by":"crossref","unstructured":"Roberto Bruttomesso Edgar Pek Natasha Sharygina and Aliaksei Tsitovich . 2010. The OpenSMT Solver. In Tools and Algorithms for the Construction and Analysis of Systems Javier Esparza and Rupak Majumdar (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 150\u2013153.","DOI":"10.1007\/978-3-642-12002-2_12"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","unstructured":"Cristian Cadar . 2015. Targeted Program Transformations for Symbolic Execution. In Proceedings of the 2015 10th Foint Meeting on Foundations of Software Engineering (Bergamo Italy) (ESEC\/FSE 2015). Association for Computing Machinery New York NY USA 906\u2013909. doi:10.1145\/2786805.2803205","DOI":"10.1145\/2786805.2803205"},{"key":"e_1_3_1_7_1","unstructured":"Cristian Cadar Daniel Dunbar and Dawson Engler . 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (San Diego California) (OSDI'08). USENIX Association USA 209\u2013224."},{"key":"e_1_3_1_8_1","doi-asserted-by":"crossref","unstructured":"Wen-Ke Chen Bengu Li and Rajiv Gupta . 2003. Code Compaction of Matching Single-Entry Multiple-Exit Regions. In Proceedings of the 10th International Conference on Static Analysis (San Diego CA USA) (SAS'03). Springer-Verlag Berlin Heidelberg 401\u2013417.","DOI":"10.1007\/3-540-44898-5_23"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","unstructured":"Weihaw Chuang B. Calder and J. Ferrante . 2003. Phi-predication for light-weight if-conversion. In International Symposium on Code Generation and Optimization 2003. CGO 2003. 179\u2013190. doi:10.1109\/CGO.2003.1191544","DOI":"10.1109\/CGO.2003.1191544"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","unstructured":"Peter Collingbourne Cristian Cadar and Paul H.J. Kelly . 2011. Symbolic Crosschecking of Floating-Point and SIMD Code. In Proceedings of the Sixth Conference on Computer Systems (Salzburg Austria) (EuroSys '11). Association for Computing Machinery New York NY USA 315\u2013328. doi:10.1145\/1966445.1966475","DOI":"10.1145\/1966445.1966475"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","unstructured":"Hayes Converse Oswaldo Olivo and Sarfraz Khurshid . 2017. Non-Semantics-Preserving Transformations for HigherCoverage Test Generation Using Symbolic Execution. In IEEE International Conference on Software Testing Verification and Validation (ICST). 241\u2013252. doi:10.1109\/ICST.2017.29","DOI":"10.1109\/ICST.2017.29"},{"key":"e_1_3_1_12_1","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein . 2009. Introduction to Algorithms Third Edition (3rd ed.). The MIT Press."},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","unstructured":"B. Coutinho D. Sampaio F. M. Q. Pereira and W. Meira Jr . 2011. Divergence Analysis and Optimizations. In 2011 International Conference on Parallel Architectures and Compilation Techniques. 320\u2013329. doi:10.1109\/PACT.2011.63","DOI":"10.1109\/PACT.2011.63"},{"key":"e_1_3_1_14_1","doi-asserted-by":"crossref","unstructured":"Leonardo de Moura and Nikolaj Bj\u00f8rner . 2008. Z3: An Efficient SMT Solver. In Tools and Algorithms for the Construction and Analysis of Systems C. R. Ramakrishnan and Jakob Rehof (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 337\u2013340.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","unstructured":"Alastair F. Donaldson Paul Thomson Vasyl Teliman Stefano Milizia Andr\u00e9 Perez Maselco and Antoni Karpi\u0144ski . 2021. Test-Case Reduction and Deduplication Almost for Free with Transformation-Based Compiler Testing. 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 1017\u20131032. doi:10.1145\/3453483.3454092","DOI":"10.1145\/3453483.3454092"},{"key":"e_1_3_1_16_1","unstructured":"Free Software Foundation . 2018. Variadic Functions (The GNU C Library) - gnu.org. https:\/\/www.gnu.org\/software\/libc\/manual\/html_node\/Variadic-Functions.html [Accessed 23-Feb-2023]."},{"key":"e_1_3_1_17_1","doi-asserted-by":"crossref","unstructured":"Vijay Ganesh and David L. Dill . 2007. A Decision Procedure for Bit-Vectors and Arrays. In Computer Aided Verification Werner Damm and Holger Hermanns (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 519\u2013531.","DOI":"10.1007\/978-3-540-73368-3_52"},{"key":"e_1_3_1_18_1","unstructured":"GNU Project . 2008a. chcon(1) - Linux man page. https:\/\/linux.die.net\/man\/1\/chcon [Accessed 18-Apr-2023]."},{"key":"e_1_3_1_19_1","unstructured":"GNU Project . 2008b. chown(1) - Linux man page. https:\/\/linux.die.net\/man\/1\/chown [Accessed 05-Oct-2025]."},{"key":"e_1_3_1_20_1","unstructured":"GNU Project . 2008c. Coreutils - GNU core utilities. https:\/\/www.gnu.org\/software\/coreutils\/[Accessed 18-Apr-2023]"},{"key":"e_1_3_1_21_1","unstructured":"GNU Project . 2008d. mkdir(1) - Linux man page. https:\/\/linux.die.net\/man\/1\/mkdir [Accessed 05-Oct-2025]."},{"key":"e_1_3_1_22_1","unstructured":"GNU Project . 2008e. mkfifo(1) - Linux man page. https:\/\/linux.die.net\/man\/1\/mkfifo [Accessed 05-Oct-2025]."},{"key":"e_1_3_1_23_1","unstructured":"GNU Project . 2023a. GNU Libtasn1. https:\/\/www.gnu.org\/software\/libtasn1\/[Accessed 18-Apr-2023]."},{"key":"e_1_3_1_24_1","unstructured":"GNU Project . 2023b. The GNU oSIP library. https:\/\/www.gnu.org\/software\/osip\/[Accessed 18-Apr-2023]."},{"key":"e_1_3_1_25_1","doi-asserted-by":"publisher","unstructured":"Patrice Godefroid Nils Klarlund and Koushik Sen . 2005. DART: Directed Automated Random Testing. In Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation. (Chicago IL USA) (PLDI '05). Association for Computing Machinery New York NY USA 213\u2013223. doi:10.1145\/1065010.1065036","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_1_26_1","unstructured":"Google . 2023. Protocol Buffers Documentation. https:\/\/protobuf.dev\/ [Accessed 11-Dec-2023]."},{"key":"e_1_3_1_27_1","doi-asserted-by":"publisher","unstructured":"Mark Harman Lin Hu Rob Hierons Joachim Wegener Harmen Sthamer Andr\u00e9 Baresel and Marc Roper . 2004. Testability Transformation. 30 1 (jan 2004) 3-16. doi:10.1109\/TSE.2004.1265732","DOI":"10.1109\/TSE.2004.1265732"},{"key":"e_1_3_1_28_1","unstructured":"ISO\/IEC JTC 1\/SC 22 . 2011. Programming Languages - C. International Standard ISO\/IEC 9899:2011. International Organization for Standardization Geneva Switzerland. https:\/\/www.iso.org\/standard\/57853.html"},{"key":"e_1_3_1_29_1","doi-asserted-by":"crossref","unstructured":"Ralf Karrenberg and Sebastian Hack . 2012. Improving Performance of OpenCL on CPUs. In Compiler Construction Michael O'Boyle (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 1\u201320.","DOI":"10.1007\/978-3-642-28652-0_1"},{"key":"e_1_3_1_30_1","doi-asserted-by":"crossref","unstructured":"Sarfraz Khurshid Corina S. P\u0103s\u0103reanu and Willem Visser . 2003. Generalized Symbolic Execution for Model Checking and Testing. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. (Warsaw Poland) (TACAS'03). Springer-Verlag Berlin Heidelberg 553\u2013568.","DOI":"10.1007\/3-540-36577-X_40"},{"key":"e_1_3_1_31_1","unstructured":"KLEE . 2023. OSDI'08 Coreutils Experiments. https:\/\/klee.github.io\/docs\/coreutils-experiments\/ [Accessed 18-Apr-2023]."},{"key":"e_1_3_1_32_1","unstructured":"David Korczynski . 2020. Some minor overflow bugs. https:\/\/github.com\/sheredom\/utf8.h\/issues\/70 GitHub issue #70 in sheredom\/utf8.h."},{"key":"e_1_3_1_33_1","doi-asserted-by":"publisher","unstructured":"Volodymyr Kuznetsov Johannes Kinder Stefan Bucur and George Candea . 2012. Efficient State Merging in Symbolic Execution. In Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (Beijing China) (PLDI '12). Association for Computing Machinery New York NY USA 193\u2013204. doi:10.1145\/2254064.2254088","DOI":"10.1145\/2254064.2254088"},{"key":"e_1_3_1_34_1","doi-asserted-by":"publisher","unstructured":"C. Lattner and V. Adve . 2004. LLVM: a compilation framework for lifelong program analysis transformation. In International Symposium on Code Generation and Optimization 2004. CGO 2004. 75\u201386. doi:10.1109\/CGO.2004.1281665","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_1_35_1","unstructured":"LLVM . 2023. CostModel.cpp. https:\/\/llvm.org\/doxygen\/CostModel_8cpp_source.html [Accessed 24-Mar-2023]."},{"key":"e_1_3_1_36_1","unstructured":"LLVM Compiler Infrastructure . 2003. LLVM Language Reference Manual. https:\/\/llvm.org\/docs\/LangRef.html [Accessed 23-Feb-2023]."},{"key":"e_1_3_1_37_1","unstructured":"LLVM Project . 2022. SimplifyCFG.cpp. https:\/\/llvm.org\/doxygen\/SimplifyCFG_8cpp_source.html [Accessed 12-Apr-2023]."},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","unstructured":"Hui Peng Yan Shoshitaishvili and Mathias Payer . 2018. T-Fuzz: Fuzzing by Program Transformation. In 2018 IEEE Symposium on Security and Privacy (SP). 697\u2013710. doi:10.1109\/SP.2018.00056","DOI":"10.1109\/SP.2018.00056"},{"key":"e_1_3_1_39_1","doi-asserted-by":"publisher","unstructured":"David M. Perry Andrea Mattavelli Xiangyu Zhang and Cristian Cadar . 2017. Accelerating Array Constraints in Symbolic Execution. In Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis (Santa Barbara CA USA) (ISSTA 2017). Association for Computing Machinery New York NY USA 68\u201378. doi:10.1145\/3092703.3092728","DOI":"10.1145\/3092703.3092728"},{"key":"e_1_3_1_40_1","doi-asserted-by":"publisher","unstructured":"Felipe Pezoa Juan L. Reutter Fernando Suarez Mart\u00edn Ugarte and Domagoj Vrgo\u010d . 2016. Foundations of JSON Schema. In Proceedings of the 25th International Conference on World Wide Web (Montr\u00e9al Qu\u00e9bec Canada) (WWW'16). International World Wide Web Conferences Steering Committee Republic and Canton of Geneva CHE 263\u2013273. doi:10.1145\/2872427.2883029","DOI":"10.1145\/2872427.2883029"},{"key":"e_1_3_1_41_1","unstructured":"Dwayne Phillips . 2008. Image Processing in C. BPB Publications New Delhi India."},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","unstructured":"Dawei Qi Hoang D. T. Nguyen and Abhik Roychoudhury . 2013. Path Exploration Based on Symbolic Output. 22 4 Article 32 (oct 2013) 41 pages. doi:10.1145\/2522920.2522925","DOI":"10.1145\/2522920.2522925"},{"key":"e_1_3_1_43_1","unstructured":"David A. Ramos and Dawson Engler . 2015. Under-Constrained Symbolic Execution: Correctness Checking for Real Code. In Proceedings of the 24th USENIX Conference on Security Symposium (Washington D.C.) (SEC'15). USENIX Association USA 49\u201364."},{"key":"e_1_3_1_44_1","doi-asserted-by":"publisher","unstructured":"Rodrigo C. O. Rocha Charitha Saumya Kirshanthan Sundararajah Pavlos Petoumenos Milind Kulkarni and Michael F. P. O'Boyle . 2023. HyBF: A Hybrid Branch Fusion Strategy for Code Size Reduction. In Proceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction (Montr\u00e9al QC Canada) (CC 2023). Association for Computing Machinery New York NY USA 156\u2013167. doi:10.1145\/3578360.3580267","DOI":"10.1145\/3578360.3580267"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","unstructured":"Charitha Saumya Muhammad Hassan Rohan Gangaraju Milind Kulkarni and Kirshanthan Sundararajah . 2026. Taming the Hydra: Targeted Control-Flow Transformations for Dynamic Symbolic Execution. doi:10.5281\/zenodo.19120042","DOI":"10.5281\/zenodo.19120042"},{"key":"e_1_3_1_46_1","doi-asserted-by":"publisher","unstructured":"Charitha Saumya Kirshanthan Sundararajah and Milind Kulkarni . 2022. DARM: Control-Flow Melding for SIMT Thread Divergence Reduction. In 2022 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO). 1\u201313. doi:10.1109\/CGO53902.2022.9741285","DOI":"10.1109\/CGO53902.2022.9741285"},{"key":"e_1_3_1_47_1","doi-asserted-by":"publisher","unstructured":"Koushik Sen Darko Marinov and Gul Agha . 2005. CUTE: A Concolic Unit Testing Engine for C. In Proceedings of the 10th European Software Engineering Conference Held Jointly with 13th ACM SIGSOFTInternational Symposium on Foundations of Software Engineering (Lisbon Portugal) (ESEC\/FSE-13). Association for Computing Machinery New York NY USA 263\u2013272. doi:10.1145\/1081706.1081750","DOI":"10.1145\/1081706.1081750"},{"key":"e_1_3_1_48_1","doi-asserted-by":"publisher","unstructured":"Vaibhav Sharma Soha Hussein Michael W. Whalen Stephen McCamant and Willem Visser . 2020. Java Ranger: statically summarizing regions for efficient symbolic execution of Java. In Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (Virtual Event USA) (ESEC\/FSE 2020). Association for Computing Machinery New York NY USA 123\u2013134. doi:10.1145\/3368089.3409734","DOI":"10.1145\/3368089.3409734"},{"key":"e_1_3_1_49_1","unstructured":"sheredom . 2023a. json.h : A simple single header solution to parsing JSON in C and C++ https:\/\/github.com\/sheredom\/ json.h\/tree\/master [Accessed 11-Dec-2023]."},{"key":"e_1_3_1_50_1","unstructured":"sheredom . 2023b. Utf-8: A simple one header solution to supporting utf8 strings in C and C++ https:\/\/github.com\/sheredom\/utf8.h\/tree\/master [Accessed 11-Dec-2023]."},{"key":"e_1_3_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"e_1_3_1_52_1","article-title":"An Isotropic 3x3 Image Gradient Operator","author":"Sobel Irwin","year":"2014","unstructured":"Irwin Sobel . 2014. An Isotropic 3x3 Image Gradient Operator. Presentation at Stanford A.I. Project 1968 (02 2014).","journal-title":"Presentation at Stanford A.I. Project 1968"},{"key":"e_1_3_1_53_1","doi-asserted-by":"publisher","unstructured":"David Trabish Andrea Mattavelli Noam Rinetzky and Cristian Cadar . 2018. Chopped Symbolic Execution. In Proceedings of the 40th International Conference on Software Engineering (Gothenburg Sweden) (ICSE T8). Association for Computing Machinery New York NY USA 350\u2013360. doi:10.1145\/3180155.3180251","DOI":"10.1145\/3180155.3180251"},{"key":"e_1_3_1_54_1","unstructured":"Jonas Wagner Volodymyr Kuznetsov and George Candea . 2013. -OVERIFY: Optimizing Programs for Fast Verification. In 14th Workshop on Hot Topics in Operating Systems (HotOS XIV). USENIX Association Santa Ana Pueblo NM. https:\/\/www.usenix.org\/conference\/hotosl3\/session\/wagner"},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","unstructured":"Xiaofei Xie Bihuan Chen Yang Liu Wei Le and Xiaohong Li . 2016. Proteus: Computing Disjunctive Loop Summary via Path Dependency Analysis. (FSE 2016). Association for Computing Machinery New York NY USA 61-72. doi:10.1145\/2950290.2950340","DOI":"10.1145\/2950290.2950340"},{"key":"e_1_3_1_56_1","doi-asserted-by":"publisher","unstructured":"Qiuping Yi Zijiang Yang Shengjian Guo Chao Wang Jian Liu and Chen Zhao . 2015. Postconditioned Symbolic Execution. In 2015 IEEE Sth International Conference on Software Testing Verification and Validation (ICST). 1\u201310. doi:10.1109\/ICST.2015.7102601","DOI":"10.1109\/ICST.2015.7102601"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798202","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T11:17:43Z","timestamp":1790421463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,10]]},"references-count":55,"journal-issue":{"issue":"OOPSLA1","published-print":{"date-parts":[[2026,4,10]]}},"alternative-id":["10.1145\/3798202"],"URL":"https:\/\/doi.org\/10.1145\/3798202","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,10]]},"assertion":[{"value":"2025-10-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}