{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T15:51:51Z","timestamp":1781711511094,"version":"3.54.5"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:00:00Z","timestamp":1781654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Department of Defense under Contract","award":["FA8702-15-D-0002"],"award-info":[{"award-number":["FA8702-15-D-0002"]}]},{"name":"Carnegie Mellon University for the operation of the Software Engineering Institute, a federally funded research and development center"},{"name":"National Science Foundation Graduate Research Fellowship","award":["DGE2140739"],"award-info":[{"award-number":["DGE2140739"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2026,7,31]]},"abstract":"<jats:p>\n                    Neural decompilers are machine learning models that reconstruct the source code from an executable program. Critical to the lifecycle of any machine learning model is an evaluation of its effectiveness. However, existing techniques for evaluating neural decompilation models are generally inadequate, especially when it comes to showing the correctness of the neural decompiler\u2019s predictions. To address this, we introduce\n                    <jats:sc>codealign<\/jats:sc>\n                    , a novel instruction-level code equivalence technique designed for neural decompilers. We provide a formal definition of a relation between equivalent instructions, which we term an equivalence alignment. We show how\n                    <jats:sc>codealign<\/jats:sc>\n                    generates equivalence alignments and then evaluate\n                    <jats:sc>codealign<\/jats:sc>\n                    by comparing it with symbolic execution. Finally, we show how the information\n                    <jats:sc>codealign<\/jats:sc>\n                    provides\u2014which parts of the functions are equivalent and how well the variable names match\u2014is substantially more detailed than existing state-of-the-art evaluation metrics, which report unitless numbers measuring similarity.\n                  <\/jats:p>","DOI":"10.1145\/3772368","type":"journal-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T15:59:06Z","timestamp":1761148746000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast, Fine-Grained Equivalence Checking for Neural Decompilers"],"prefix":"10.1145","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5845-5628","authenticated-orcid":false,"given":"Luke","family":"Dramko","sequence":"first","affiliation":[{"name":"School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3931-060X","authenticated-orcid":false,"given":"Claire Le","family":"Goues","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0094-4805","authenticated-orcid":false,"given":"Edward J.","family":"Schwartz","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University Software Engineering Institute, Pittsburgh, Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,17]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2019.2944914"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73561"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520312.3534867"},{"key":"e_1_3_2_5_1","first-page":"67","volume-title":"Proceedings of the 2024 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)","author":"Armengol-Estap\u00e9 Jordi","year":"2024","unstructured":"Jordi Armengol-Estap\u00e9, Jackson Woodruff, Chris Cummins, and Michael F. P. O\u2019Boyle. 2024. SLaDe: A portable small language model decompiler for optimized assembly. In Proceedings of the 2024 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO). IEEE, 67\u201380."},{"key":"e_1_3_2_6_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/3368089.3409757","volume-title":"Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","author":"Badihi Sahar","year":"2020","unstructured":"Sahar Badihi, Faridah Akinotcho, Yi Li, and Julia Rubin. 2020. ARDiff: Scaling program equivalence checking via iterative abstraction and refinement of common code. In Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 13\u201324."},{"key":"e_1_3_2_7_1","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Proceedings of the 4th International Symposium on Formal Methods for Components and Objects (FMCO \u201905), Revised Lectures 4","author":"Barnett Mike","year":"2006","unstructured":"Mike Barnett, Bor-Yuh Evan Chang, Robert DeLine, Bart Jacobs, and K. Rustan M. Leino. 2006. Boogie: A modular reusable verifier for object-oriented programs. In Proceedings of the 4th International Symposium on Formal Methods for Components and Objects (FMCO \u201905), Revised Lectures 4, Springer, 364\u2013387."},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21437-0_17"},{"issue":"8","key":"e_1_3_2_9_1","first-page":"209","article-title":"Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, Dawson R. Engler. 2008. Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. OSDI 8 (2008), 209\u2013224.","journal-title":"OSDI"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564625.3567998"},{"key":"e_1_3_2_11_1","first-page":"4327","volume-title":"Proceedings of the USENIX Security Symposium","author":"Chen Qibin","year":"2022","unstructured":"Qibin Chen, Jeremy Lacomis, Edward J. Schwartz, Claire Le Goues, Graham Neubig, and Bogdan Vasilescu. 2022a. Augmenting decompiler output with learned variable names and types. In Proceedings of the USENIX Security Symposium, 4327\u20134343."},{"key":"e_1_3_2_12_1","doi-asserted-by":"crossref","first-page":"2327","DOI":"10.1145\/3510003.3510162","volume-title":"Proceedings of the 44th International Conference on Software Engineering","author":"Chen Qibin","year":"2022","unstructured":"Qibin Chen, Jeremy Lacomis, Edward J. Schwartz, Graham Neubig, Bogdan Vasilescu, and Claire Le Goues. 2022b. Varclr: Variable semantic representation pre-training via contrastive learning. In Proceedings of the 44th International Conference on Software Engineering, 2327\u20132339."},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314596"},{"key":"e_1_3_2_14_1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-319-71237-6_7","volume-title":"Proceedings of the 15th Asian Symposium on Programming Languages and Systems (APLAS \u201917)","author":"Dahiya Manjeet","year":"2017","unstructured":"Manjeet Dahiya and Sorav Bansal. 2017. Black-box equivalence checking across compiler optimizations. In Proceedings of the 15th Asian Symposium on Programming Languages and Systems (APLAS \u201917). Springer, 127\u2013147."},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_16_1","unstructured":"Luke Dramko Claire Le Goues and Edward J. Schwartz. 2025. Idioms: Neural decompilation with joint code and type prediction. arXiv:2502.04536. Retrieved from https:\/\/arxiv.org\/abs\/2502.04536"},{"key":"e_1_3_2_17_1","unstructured":"Luke Dramko Jeremy Lacomis Edward J. Schwartz Bogdan Vasilescu and Claire Le Goues. 2024. A taxonomy of C decompiler fidelity issues. In Proceedings of the 33rd USENIX Security Symposium (USENIX Security \u201924) 379\u2013396."},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556903"},{"key":"e_1_3_2_19_1","unstructured":"Michael James Van Emmerik. 2007. Single Static Assignment for Decompilation. Ph.D. Dissertation. The University of Queensland School of Information Technology and Electrical Engineering. Retrieved from http:\/\/vanemmerikfamily.com\/mike\/master.pdf"},{"key":"e_1_3_2_20_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems","author":"Fu Cheng","year":"2019","unstructured":"Cheng Fu, Huili Chen, Haolan Liu, Xinyun Chen, Yuandong Tian, Farinaz Koushanfar, and Jishen Zhao. 2019. Coda: An end-to-end neural program decompiler. In Proceedings of the Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372123"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428289"},{"key":"e_1_3_2_23_1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-319-94144-8_22","volume-title":"Proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing (SAT \u201918)","author":"Gupta Shubhani","year":"2018","unstructured":"Shubhani Gupta, Aseem Saxena, Anmol Mahajan, and Sorav Bansal. 2018. Effective use of SMT solvers for program equivalence checking through invariant-sketching and query-decomposition. In Proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing (SAT \u201918). Springer, 365\u2013382."},{"key":"e_1_3_2_24_1","unstructured":"Peiwei Hu Ruigang Liang and Kai Chen. 2024. DeGPT: Optimizing decompiler output with LLM. In Proceedings of the 2024 Network and Distributed System Security Symposium."},{"key":"e_1_3_2_25_1","unstructured":"Nan Jiang Chengxiao Wang Kevin Liu Xiangzhe Xu Lin Tan and Xiangyu Zhang. 2025. Nova: Generative language models for assembly code with hierarchical attention and contrastive learning. In ICLR."},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2018.8330222"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00064"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_54"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1186\/s42400-021-00070-0"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330577"},{"key":"e_1_3_2_31_1","unstructured":"Shuai Lu Daya Guo Shuo Ren Junjie Huang Alexey Svyatkovskiy Ambrosio Blanco Colin B. Clement Dawn Drain Daxin Jiang Duyu Tang et al. 2021. CodeXGLUE: A machine learning benchmark dataset for code understanding and generation. In NeurIPS."},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349314"},{"key":"e_1_3_2_33_1","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy","author":"Pal Kuntal Kumar","year":"2024","unstructured":"Kuntal Kumar Pal, Ati Priya Bajaj, Pratyay Banerjee, Audrey Dutcher, Mutsumi Nakamura, Zion Leonahenahe Basque, Himanshu Gupta, Arjun Sawant, Ujjwala Anantheswaran, Yan Shoshitaishvili, et al. 2024. \u201cLen or index or count, anything but v1\u201d: Predicting variable names in decompilation output with transfer learning. In Proceedings of the IEEE Symposium on Security and Privacy. Retrieved from https:\/\/github.com\/sefcom\/VarBERT"},{"key":"e_1_3_2_34_1","first-page":"311","volume-title":"Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics","author":"Papineni Kishore","year":"2002","unstructured":"Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. Bleu: A method for automatic evaluation of machine translation. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, 311\u2013318."},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453131"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2013.01.008"},{"key":"e_1_3_2_37_1","unstructured":"Shuo Ren Daya Guo Shuai Lu Long Zhou Shujie Liu Duyu Tang Neel Sundaresan Ming Zhou Ambrosio Blanco and Shuai Ma. 2020. Codebleu: A method for automatic evaluation of code synthesis. arXiv:2009.10297. Retrieved from https:\/\/arxiv.org\/abs\/2009.10297"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73562"},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.02.007"},{"key":"e_1_3_2_40_1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/MSR.2013.6624021","volume-title":"Proceedings of the 2013 10th Working Conference on Mining Software Repositories (MSR)","author":"Saha Ripon K.","year":"2013","unstructured":"Ripon K. Saha, Chanchal K. Roy, Kevin A. Schneider, and Dewayne E. Perry. 2013. Understanding the evolution of type-3 clones: An exploratory study. In Proceedings of the 2013 10th Working Conference on Mining Software Repositories (MSR). IEEE, 139\u2013148."},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462183"},{"key":"e_1_3_2_42_1","article-title":"The strange story of the teens behind the mirai botnet","volume":"23","author":"Shapiro Scott J.","year":"2023","unstructured":"Scott J. Shapiro. 2023. The strange story of the teens behind the mirai botnet. IEEE Spectrum 23 (2023). Retrieved from https:\/\/spectrum.ieee.org\/mirai-botnet","journal-title":"IEEE Spectrum"},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.1059"},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032364"},{"key":"e_1_3_2_45_1","doi-asserted-by":"crossref","unstructured":"Hanzhuo Tan Qi Luo Jing Li and Yuqun Zhang. 2024. LLM4Decompile: Decompiling binary code with large language models. In EMNLP 3473\u20133487.","DOI":"10.18653\/v1\/2024.emnlp-main.203"},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2019.00034"},{"key":"e_1_3_2_47_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.68"},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.685"},{"key":"e_1_3_2_49_1","first-page":"2135","volume-title":"Proceedings of the 31st USENIX Security Symposium (USENIX Security \u201922)","author":"Wu Ruoyu","year":"2022","unstructured":"Ruoyu Wu, Taegyu Kim, Dave Jing Tian, Antonio Bianchi, and Dongyan Xu. 2022. DnD: A cross-architecture deep neural network decompiler. In Proceedings of the 31st USENIX Security Symposium (USENIX Security \u201922), 2135\u20132152."},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00099"},{"key":"e_1_3_2_51_1","volume-title":"Detecting Program Components with Equivalent Behaviors","author":"Yang Wuu","year":"1989","unstructured":"Wuu Yang, Susan Horwitz, and Thomas Reps. 1989. Detecting Program Components with Equivalent Behaviors. Technical Report. University of Wisconsin-Madison Department of Computer Sciences."},{"key":"e_1_3_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2023.111796"},{"key":"e_1_3_2_53_1","doi-asserted-by":"crossref","first-page":"13921","DOI":"10.18653\/v1\/2023.emnlp-main.859","volume-title":"Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing","author":"Zhou Shuyan","year":"2023","unstructured":"Shuyan Zhou, Uri Alon, Sumit Agarwal, and Graham Neubig. 2023. CodeBERTScore: Evaluating code generation with pretrained models of code. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 13921\u201313937."},{"key":"e_1_3_2_54_1","first-page":"397","volume-title":"Proceedings of the 33rd USENIX Security Symposium (USENIX Security \u201924)","author":"Zou Muqi","year":"2024","unstructured":"Muqi Zou, Arslan Khan, Ruoyu Wu, Han Gao, Antonio Bianchi, and Dave Jing Tian. 2024. D-Helix: A generic decompiler testing framework using symbolic differentiation. In Proceedings of the 33rd USENIX Security Symposium (USENIX Security \u201924), 397\u2013414."}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3772368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T14:54:30Z","timestamp":1781708070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,17]]},"references-count":53,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7,31]]}},"alternative-id":["10.1145\/3772368"],"URL":"https:\/\/doi.org\/10.1145\/3772368","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,17]]},"assertion":[{"value":"2025-02-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}