Revisiting Binary Code Similarity Analysis Using Interpretable Feature Engineering and Lessons Learned
Top Cited Papers
Open Access
- 1 July 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 49 (4) , 1661-1682
Abstract
Binary code similarity analysis (BCSA) is widely used for diverse security applications such as plagiarism detection, software license violation detection, and vulnerability discovery. Despite the surging research interest in BCSA, it is significantly challenging to perform new research in this field for several reasons. First, most existing approaches focus only on the end results, namely, increasing the success rate of BCSA by adopting uninterpretable machine learning. Moreover, they utilize their own benchmark sharing neither the source code nor the entire dataset. Finally, researchers often use different terminologies or even use the same technique without citing the previous literature properly, which makes it difficult to reproduce or extend previous work. To address these problems, we take a step back from the mainstream and contemplate fundamental research questions for BCSA. Why does a certain technique or a feature show better results than the others? Specifically, we conduct the first systematic study on the basic features used in BCSA by leveraging interpretable feature engineering on a large-scale benchmark. Our study reveals various useful insights on BCSA. For example, we show that a simple interpretable model with a few basic features can achieve a comparable result to that of recent deep learning-based approaches. Furthermore, we show that the way we compile binaries or the correctness of underlying binary analysis tools can significantly affect the performance of BCSA. Lastly, we make all our source code and benchmark public and suggest future directions in this field to help further research.Keywords
All Related Versions
Funding Information
- Institute of Information & Communications Technology Planning & Evaluation (2021-0-01332)
- Developing Next-Generation Binary Decompiler
This publication has 118 references indexed in Scilit:
- SYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs2012
- Automated Identification of Cryptographic Primitives in Binary Programs2011
- Malware Analysis with Tree Automata InferenceLecture Notes in Computer Science, 2011
- BinHunt: Automatically Finding Semantic Differences in Binary Programs2008
- Jakstab: A Static Analysis Platform for Binaries2008
- Extremely randomized treesMachine Learning, 2006
- CCFinder: a multilinguistic token-based code clone detection system for large scale source codeIEEE Transactions on Software Engineering, 2002
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997
- SIGNATURE VERIFICATION USING A “SIAMESE” TIME DELAY NEURAL NETWORK1994
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987