{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:02:33Z","timestamp":1783396953702,"version":"3.54.6"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:00:00Z","timestamp":1685145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61902306, 62002280, 61721002, 61833015"],"award-info":[{"award-number":["61902306, 62002280, 61721002, 61833015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CCF-Tencent Open Research Fund, the Fundamental Research Funds for the Central Universities","award":["xxj022019001, xzy012020009"],"award-info":[{"award-number":["xxj022019001, xzy012020009"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"crossref","award":["2020M683507, 2019TQ0251, 2020M673439"],"award-info":[{"award-number":["2020M683507, 2019TQ0251, 2020M673439"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Youth Talent Support Plan of Xi\u2019an Association for Science and Technology","award":["095920201303"],"award-info":[{"award-number":["095920201303"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2023,10,31]]},"abstract":"<jats:p>Binary similarity analysis is critical to many code-reuse-related issues, where function matching is its fundamental task. \u201c<jats:bold>1-to-1<\/jats:bold>\u201d mechanism has been applied in most binary similarity analysis works, in which one function in a binary file is matched against one function in a source file or binary file. However, we discover that the function mapping is a more complex problem of \u201c<jats:bold>1-to-n<\/jats:bold>\u201d (one binary function matches multiple source functions or binary functions) or even \u201c<jats:bold>n-to-n<\/jats:bold>\u201d (multiple binary functions match multiple binary functions) due to the existence of<jats:bold>function inlining<\/jats:bold>, different from traditional understanding.<\/jats:p><jats:p>In this article, we investigate the effect of function inlining on binary similarity analysis. We carry out three studies to investigate the extent of function inlining, the performance of existing works under function inlining, and the effectiveness of existing inlining-simulation strategies. Firstly, a scalable and lightweight identification method is designed to recover function inlining in binaries. 88 projects (compiled in 288 versions and resulting in 32,460,156 binary functions) are collected and analyzed to construct four inlining-oriented datasets for four security tasks in the software supply chain, including code search, OSS (Open Source Software) reuse detection, vulnerability detection, and patch presence test. Datasets reveal that the proportion of function inlining ranges from 30\u201340% when using O3 and sometimes can reach nearly 70%. Then, we evaluate four existing works on our dataset. Results show most existing works neglect inlining and use the \u201c1-to-1\u201d mechanism. The mismatches cause a 30% loss in performance during code search and a 40% loss during vulnerability detection. Moreover, most inlined functions would be ignored during OSS reuse detection and patch presence test, thus leaving these functions risky. Finally, we analyze two inlining-simulation strategies on our dataset. It is shown that they miss nearly 40% of the inlined functions, and there is still a large space for promotion. By precisely recovering when function inlining happens, we discover that inlining is usually cumulative when optimization increases. Thus, conditional inlining and incremental inlining are recommended to design a low-cost and high-coverage inlining-simulation strategy.<\/jats:p>","DOI":"10.1145\/3561385","type":"journal-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T11:54:46Z","timestamp":1662465286000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["1-to-1 or 1-to-n? Investigating the Effect of Function Inlining on Binary Similarity Analysis"],"prefix":"10.1145","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6464-5428","authenticated-orcid":false,"given":"Ang","family":"Jia","sequence":"first","affiliation":[{"name":"Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi\u2019an Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9327-0987","authenticated-orcid":false,"given":"Ming","family":"Fan","sequence":"additional","affiliation":[{"name":"Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi\u2019an Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9137-4635","authenticated-orcid":false,"given":"Wuxia","family":"Jin","sequence":"additional","affiliation":[{"name":"Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi\u2019an Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5089-6018","authenticated-orcid":false,"given":"Xi","family":"Xu","sequence":"additional","affiliation":[{"name":"Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi\u2019an Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5420-4461","authenticated-orcid":false,"given":"Zhaohui","family":"Zhou","sequence":"additional","affiliation":[{"name":"Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi\u2019an Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8200-7518","authenticated-orcid":false,"given":"Qiyi","family":"Tang","sequence":"additional","affiliation":[{"name":"Tencent Security Keen Lab"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4154-2941","authenticated-orcid":false,"given":"Sen","family":"Nie","sequence":"additional","affiliation":[{"name":"Tencent Security Keen Lab"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6842-7487","authenticated-orcid":false,"given":"Shi","family":"Wu","sequence":"additional","affiliation":[{"name":"Tencent Security Keen Lab"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7600-0934","authenticated-orcid":false,"given":"Ting","family":"Liu","sequence":"additional","affiliation":[{"name":"Ministry of Education Key Lab for Intelligent Networks and Network Security, School of Cyber Science and Engineering, Xi\u2019an Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"2009. Cisco settles FSF GPL lawsuit. [Online; accessed April 7 2021]. Retrieved from http:\/\/arstechnica.com\/information-technology\/2009\/05\/cisco-settles-fsf-gpl-lawsuit-appoints-compliance-officer."},{"key":"e_1_3_2_3_2","unstructured":"2015. VMware sued for failure to comply with Linux license. [Online; accessed April 7 2021]. Retrieved from https:\/\/www.zdnet.com\/article\/vmware-sued-for-failure-to-comply-with-linuxs-license\/."},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","unstructured":"2020. Reveiws 1\u2014SciTools. [Online; accessed 3-September-2021]. Retrieved from https:\/\/news.sophos.com\/en-us\/2020\/04\/26\/asnarok\/.","DOI":"10.1055\/a-1160-2837"},{"key":"e_1_3_2_5_2","unstructured":"2020. What\u2019s up Emotet? CERT Polska. [Online; accessed 3-September-2021]. Retrieved from https:\/\/cert.pl\/en\/posts\/2020\/02\/whats-up-emotet\/."},{"key":"e_1_3_2_6_2","unstructured":"2021. \u201cAsnar\u00f6k\u201d Trojan targets firewalls. [Online; accessed 3-September-2021]. Retrieved from https:\/\/www.scitools.com\/us-air-force-case-study."},{"key":"e_1_3_2_7_2","unstructured":"2021. Binutils\u2014GNU Project - Free Software Foundation. [Online; accessed 4-August-2021]. Retrieved from https:\/\/www.gnu.org\/software\/binutils\/."},{"key":"e_1_3_2_8_2","unstructured":"2021. Clang: A C language family frontend for LLVM. [Online; accessed 20-April-2021]. Retrieved from https:\/\/clang.llvm.org\/."},{"key":"e_1_3_2_9_2","unstructured":"2021. Coreutils\u2014GNU core utilities. [Online; accessed 23-April-2021]. Retrieved from https:\/\/www.gnu.org\/software\/coreutils\/."},{"key":"e_1_3_2_10_2","unstructured":"2021. findutils\u2014GNU Project - Free Software Foundation (FSF). [Online; accessed 4-August-2021]. Retrieved from https:\/\/www.gnu.org\/software\/findutils\/."},{"key":"e_1_3_2_11_2","unstructured":"2021. Function Inlining. [Online; accessed 3-September-2021]. Retrieved from https:\/\/compileroptimizations.com\/category\/function_inlining.htm."},{"key":"e_1_3_2_12_2","unstructured":"2021. GCC the GNU Compiler Collection. [Online; accessed 16-April-2021]. Retrieved from https:\/\/gcc.gnu.org\/."},{"key":"e_1_3_2_13_2","unstructured":"2021. The Chromium Projects. [Online; accessed 28-December-2021]. Retrieved from https:\/\/www.chromium.org\/."},{"key":"e_1_3_2_14_2","unstructured":"2021. The LLVM Compiler Infrastructure. [Online; accessed 16-April-2021]. Retrieved from https:\/\/llvm.org\/."},{"key":"e_1_3_2_15_2","unstructured":"2022. bzip2. Retrieved 23 April 2021 from http:\/\/www.bzip.org\/."},{"key":"e_1_3_2_16_2","unstructured":"2022. Faster Chrome\u2014Let The Compiler do the work. [Online; accessed 27-June-2022]. Retrieved from https:\/\/blog.chromium.org\/2021\/12\/faster-chrome-let-the-compiler-do-the-work.html."},{"key":"e_1_3_2_17_2","unstructured":"2022. Retrieved 23 April 2021 from minizip. https:\/\/github.com\/nmoinvaz\/minizip."},{"key":"e_1_3_2_18_2","unstructured":"2022. Retrieved 23 April 2021 from OpenSSL. https:\/\/www.openssl.org\/."},{"key":"e_1_3_2_19_2","unstructured":"2022. Preprocessor directives. [Online; accessed 27-June-2022]. Retrieved from https:\/\/docs.microsoft.com\/en-us\/cpp\/preprocessor\/preprocessor-directives."},{"key":"e_1_3_2_20_2","first-page":"583","volume-title":"Proceedings of the 25th USENIX Security Symposium, USENIX Security 16, Austin","author":"Andriesse Dennis","year":"2016","unstructured":"Dennis Andriesse, Xi Chen, Victor van der Veen, Asia Slowinska, and Herbert Bos. 2016. An in-depth analysis of disassembly on full-scale x86\/x64 binaries. In Proceedings of the 25th USENIX Security Symposium, USENIX Security 16, Austin. USENIX Association, 583\u2013600."},{"issue":"1","key":"e_1_3_2_21_2","first-page":"1","article-title":"B2SMatcher: Fine-grained version identification of open-Source software in binary files","volume":"4","author":"Ban Gu","year":"2021","unstructured":"Gu Ban, Lili Xu, Yang Xiao, Xinhua Li, Zimu Yuan, and Wei Huo. 2021. B2SMatcher: Fine-grained version identification of open-Source software in binary files. Cybersecurity 4, 1 (2021), 1\u201321.","journal-title":"Cybersecurity"},{"key":"e_1_3_2_22_2","volume-title":"Proceedings of the MLPA 2020-Machine Learning for Program Analysis","author":"Bardin S\u00e9bastien","year":"2021","unstructured":"S\u00e9bastien Bardin, Tristan Benoit, and Jean-Yves Marion. 2021. Compiler and optimization level recognition using graph neural networks. In Proceedings of the MLPA 2020-Machine Learning for Program Analysis."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950350"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908126"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2666356.2594343"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/2939672.2939719","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Ding Steven H. H.","year":"2016","unstructured":"Steven H. H. Ding, Benjamin C. M. Fung, and Philippe Charland. 2016. Kam1n0: Mapreduce-based assembly clone search for reverse engineering. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 461\u2013470."},{"key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/SP.2019.00003","volume-title":"Proceedings of the 2019 IEEE Symposium on Security and Privacy (SP)","author":"Ding Steven H. H.","year":"2019","unstructured":"Steven H. H. Ding, Benjamin C. M. Fung, and Philippe Charland. 2019. Asm2vec: Boosting static representation robustness for binary clone search against code obfuscation and compiler optimization. In Proceedings of the 2019 IEEE Symposium on Security and Privacy (SP). IEEE, 472\u2013489."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134048"},{"key":"e_1_3_2_29_2","volume-title":"Proceedings of the Network and Distributed System Security Symposium","author":"Duan Yue","year":"2020","unstructured":"Yue Duan, Xuezixiang Li, Jinghan Wang, and Heng Yin. 2020. Deepbindiff: Learning program-wide code representations for binary diffing. In Proceedings of the Network and Distributed System Security Symposium."},{"key":"e_1_3_2_30_2","first-page":"303","volume-title":"Proceedings of the 23rd \\(\\lbrace\\) USENIX \\(\\rbrace\\) Security Symposium ( \\(\\lbrace\\) USENIX \\(\\rbrace\\) Security 14)","author":"Egele Manuel","year":"2014","unstructured":"Manuel Egele, Maverick Woo, Peter Chapman, and David Brumley. 2014. Blanket execution: Dynamic similarity testing for program binaries and components. In Proceedings of the 23rd \\(\\lbrace\\) USENIX \\(\\rbrace\\) Security Symposium ( \\(\\lbrace\\) USENIX \\(\\rbrace\\) Security 14). 303\u2013317."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2806891"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2687880"},{"key":"e_1_3_2_33_2","first-page":"771","volume-title":"Proceedings of the 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE)","author":"Fan Ming","year":"2019","unstructured":"Ming Fan, Xiapu Luo, Jun Liu, Meng Wang, Chunyin Nong, Qinghua Zheng, and Ting Liu. 2019. Graph embedding based familial analysis of android malware using unsupervised learning. In Proceedings of the 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE). IEEE, 771\u2013782."},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2019.8667977"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00100"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88625-9_16"},{"key":"e_1_3_2_37_2","first-page":"896","volume-title":"Proceedings of the 2018 33rd IEEE\/ACM International Conference on Automated Software Engineering (ASE)","author":"Gao Jian","year":"2018","unstructured":"Jian Gao, Xin Yang, Ying Fu, Yu Jiang, and Jiaguang Sun. 2018. VulSeeker: A semantic learning based vulnerability seeker for cross-platform binary. In Proceedings of the 2018 33rd IEEE\/ACM International Conference on Automated Software Engineering (ASE). IEEE, 896\u2013899."},{"key":"e_1_3_2_38_2","unstructured":"Dale Gardner. 2019. Technology Insight for Software Composition Analysis. [Online; accessed 27-November-2021]. Retrieved from https:\/\/www.gartner.com\/en\/documents\/3971011\/technology-insight-for-software-composition-analysis."},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/1985441.1985453"},{"key":"e_1_3_2_40_2","volume-title":"Proceedings of the 16th ACM ASIA Conference on Computer and Communications Security (ASIACCS)","author":"Ji Yuede","year":"2021","unstructured":"Yuede Ji, Lei Cui, and H. Howie Huang. 2021. BugGraph: Differentiating source-binary code similarity with graph triplet-loss network. In Proceedings of the 16th ACM ASIA Conference on Computer and Communications Security (ASIACCS)."},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1944892.1944908"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.22667\/JISIS.2014.11.31.025"},{"key":"e_1_3_2_43_2","volume-title":"Proceedings of the IEEE Transactions on Software Engineering","author":"Kim Dongkwan","year":"2020","unstructured":"Dongkwan Kim, Eunsoo Kim, Sang Kil Cha, Sooel Son, and Yongdae Kim. 2020. Revisiting binary code similarity analysis using interpretable feature engineering and lessons learned. In Proceedings of the IEEE Transactions on Software Engineering. IEEE."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386020"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3238199"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2655046"},{"key":"e_1_3_2_47_2","first-page":"309","volume-title":"Proceedings of the International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment","author":"Massarelli Luca","year":"2019","unstructured":"Luca Massarelli, Giuseppe Antonio Di Luna, Fabio Petroni, Roberto Baldoni, and Leonardo Querzoni. 2019. Safe: Self-attentive function embeddings for binary similarity. In Proceedings of the International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment. Springer, 309\u2013329."},{"key":"e_1_3_2_48_2","unstructured":"Dhaval Miyani Zhen Huang and David Lie. 2017. BinPro: A tool for binary source code provenance. CoRR abs\/1711.00830 (2017). Retrieved from https:\/\/arxiv.org\/abs\/1711.00830."},{"key":"e_1_3_2_49_2","volume-title":"Proceedings of the 3rd Workshop on Binary Analysis Research","author":"Otsubo Yuhei","year":"2020","unstructured":"Yuhei Otsubo, Akira Otsuka, Mamoru Mimura, Takeshi Sakaki, and Hiroshi Ukegawa. 2020. o-glassesX: Compiler provenance recovery with attention mechanism from a short code fragment. In Proceedings of the 3rd Workshop on Binary Analysis Research."},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1109\/SP40001.2021.00012","volume-title":"Proceedings of the 2021 IEEE Symposium on Security and Privacy (SP)","author":"Pang Chengbin","year":"2021","unstructured":"Chengbin Pang, Ruotong Yu, Yaohui Chen, Eric Koskinen, Georgios Portokalidis, Bing Mao, and Jun Xu. 2021. Sok: All you ever wanted to know about x86\/x64 binary disassembly but were afraid to ask. In Proceedings of the 2021 IEEE Symposium on Security and Privacy (SP). IEEE, 833\u2013851."},{"key":"e_1_3_2_51_2","volume-title":"Proceedings of the 28th Annual Network and Distributed System Security Symposium (NDSS\u201921)","author":"Pei Kexin","year":"2021","unstructured":"Kexin Pei, Jonas Guan, David Williams-King, Junfeng Yang, and Suman Jana. 2021. Xda: Accurate, robust disassembly with transfer learning. In Proceedings of the 28th Annual Network and Distributed System Security Symposium (NDSS\u201921). The Internet Society. https:\/\/www.ndss-symposium.org\/ndss-paper\/xda-accurate-robust-disassembly-with-transfer-learning\/."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1515\/itit-2016-0040"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2921936"},{"key":"e_1_3_2_54_2","volume-title":"JPlag: Finding plagiarisms among a set of programs","author":"Prechelt Lutz","year":"2000","unstructured":"Lutz Prechelt, Guido Malpohl, and Michael Philippsen. 2000. JPlag: Finding plagiarisms among a set of programs. Citeseer."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37119-6_14"},{"key":"e_1_3_2_56_2","first-page":"S146\u2013S155","article-title":"Bincomp: A stratified approach to compiler provenance attribution","volume":"14","author":"Rahimian Ashkan","year":"2015","unstructured":"Ashkan Rahimian, Paria Shirani, Saed Alrbaee, Lingyu Wang, and Mourad Debbabi. 2015. Bincomp: A stratified approach to compiler provenance attribution. Digital Investigation 14, Supplement 1 (2015), S146\u2013S155.","journal-title":"Digital Investigation"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001433"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3069227"},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.jss.2016.06.014","article-title":"Exploiting thread-related system calls for plagiarism detection of multithreaded programs","volume":"9","author":"Tian Zhenzhou","year":"2016","unstructured":"Zhenzhou Tian, Ting Liu, Qinghua Zheng, Ming Fan, Eryue Zhuang, and Zijiang Yang. 2016. Exploiting thread-related system calls for plagiarism detection of multithreaded programs. Journal of Systems and Software 9, 1 (2016), 136\u2013148.","journal-title":"Journal of Systems and Software"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2688383"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/tse.2015.2454508"},{"key":"e_1_3_2_62_2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/ASE.2017.8115645","volume-title":"Proceedings of the 2017 32nd IEEE\/ACM International Conference on Automated Software Engineering (ASE)","author":"Wang Shuai","year":"2017","unstructured":"Shuai Wang and Dinghao Wu. 2017. In-memory fuzzing for binary code similarity analysis. In Proceedings of the 2017 32nd IEEE\/ACM International Conference on Automated Software Engineering (ASE). IEEE, 319\u2013330."},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134018"},{"key":"e_1_3_2_64_2","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/ICSE43902.2021.00084","volume-title":"Proceedings of the 2021 IEEE\/ACM 43rd International Conference on Software Engineering (ICSE)","author":"Xu Xi","year":"2021","unstructured":"Xi Xu, Qinghua Zheng, Zheng Yan, Ming Fan, Ang Jia, and Ting Liu. 2021. Interpretation-enabled software reuse detection based on a multi-level birthmark model. In Proceedings of the 2021 IEEE\/ACM 43rd International Conference on Software Engineering (ICSE). IEEE, 873\u2013884."},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/3395363.3397361"},{"issue":"11","key":"e_1_3_2_66_2","first-page":"1125","article-title":"Accurate and scalable cross-architecture cross-os binary code search with emulation","volume":"45","author":"Xue Yinxing","year":"2018","unstructured":"Yinxing Xue, Zhengzi Xu, Mahinthan Chandramohan, and Yang Liu. 2018. Accurate and scalable cross-architecture cross-os binary code search with emulation. IEEE Transactions on Software Engineering 45, 11 (2018), 1125\u20131149.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_67_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6\u201312, 2020, virtual","author":"Yu Zeping","year":"2020","unstructured":"Zeping Yu, Wenxin Zheng, Jiaqi Wang, Qiyi Tang, Sen Nie, and Shi Wu. 2020. CodeCMR: Cross-modal retrieval for function-level binary source code matching. In Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6\u201312, 2020, virtual."},{"key":"e_1_3_2_68_2","first-page":"887","volume-title":"Proceedings of the 27th USENIX Security Symposium, USENIX Security 2018","author":"Zhang Hang","year":"2018","unstructured":"Hang Zhang and Zhiyun Qian. 2018. Precise and accurate patch presence test for binaries. In Proceedings of the 27th USENIX Security Symposium, USENIX Security 2018. USENIX Association, 887\u2013902."},{"key":"e_1_3_2_69_2","volume-title":"Proceedings of the 26th Annual Network and Distributed System Security Symposium, NDSS 2019","author":"Zuo Fei","year":"2019","unstructured":"Fei Zuo, Xiaopeng Li, Patrick Young, Lannan Luo, Qiang Zeng, and Zhexin Zhang. 2019. Neural machine translation inspired binary code similarity comparison beyond function pairs. In Proceedings of the 26th Annual Network and Distributed System Security Symposium, NDSS 2019. The Internet Society."}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:35Z","timestamp":1750186835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,27]]},"references-count":68,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,10,31]]}},"alternative-id":["10.1145\/3561385"],"URL":"https:\/\/doi.org\/10.1145\/3561385","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,27]]},"assertion":[{"value":"2022-04-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}