BinaryAI: Binary Software Composition Analysis via Intelligent Binary Source Code Matching
Not on the map. Why?
Abstract (arXiv)
While third-party libraries are extensively reused to enhance productivity during software development, they can also introduce potential security risks such as vulnerability propagation. Software composition analysis, proposed to identify reused TPLs for reducing such risks, has become an essential procedure within modern DevSecOps. As one of the mainstream SCA techniques, binary-to-source SCA identifies the third-party source projects contained in binary files via binary source code matching, which is a major challenge in reverse engineering since binary and source code exhibit substantial disparities after compilation. The existing binary-to-source SCA techniques leverage basic syntactic features that suffer from redundancy and lack robustness in the large-scale TPL dataset, leading to inevitable false positives and compromised recall. To mitigate these limitations, we introduce BinaryAI, a novel binary-to-source SCA technique with two-phase binary source code matching to capture both syntactic and semantic code features. First, BinaryAI trains a transformer-based model to produce function-level embeddings and obtain similar source functions for each binary function accordingly. Then by applying the link-time locality to facilitate function matching, BinaryAI detects the reused TPLs based on the ratio of matched source functions. Our experimental results demonstrate the superior performance of BinaryAI in terms of binary source code matching and the downstream SCA task. Specifically, our embedding model outperforms the state-of-the-art model CodeCMR, i.e., achieving 22.54% recall@1 and 0.34 MRR compared with 10.75% and 0.17 respectively. Additionally, BinaryAI outperforms all existing binary-to-source SCA tools in TPL detection, increasing the precision from 73.36% to 85.84% and recall from 59.81% to 64.98% compared with the well-recognized commercial SCA product.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jan 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 2; 2026: 4.
9 papers.
- 2024CLAP: Learning Transferable Binary Code Representations with Natural Language Supervisioncited by 17
- 2024Prompt-based Code Completion via Multi-Retrieval Augmented Generationcited by 16
- 2025Large Language Model (LLM) for Software Security: Code Analysis, Malware Analysis, Reverse Engineeringcited by 15
- 2025CompileAgent: Automated Real-World Repo-Level Compilation with Tool-Integrated LLM-based Agent Systemcited by 15
- 2024Source Code Foundation Models are Transferable Binary Analysis Knowledge Basescited by 8
- 2026InstMeter: An Instruction-Level Method to Predict Energy and Latency of DL Model Inference on MCUscited by 2
- 2026ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coveragecited by 0
- 2026SoK: AI-Augmented Binary Reversingcited by 0
- 2026Instruction Alignment for Binary Code Representation Learningcited by 0
- 2026Instruction Alignment for Binary Code Representation Learning12 Aug 2026
- 2026SoK: AI-Augmented Binary Reversing16 Jun 2026
- 2026ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage20 May 2026
- 2026InstMeter: An Instruction-Level Method to Predict Energy and Latency of DL Model Inference on MCUs4 Mar 2026
- 2025CompileAgent: Automated Real-World Repo-Level Compilation with Tool-Integrated LLM-based Agent System7 May 2025
- 2025Large Language Model (LLM) for Software Security: Code Analysis, Malware Analysis, Reverse Engineering7 Apr 2025
- 2024Source Code Foundation Models are Transferable Binary Analysis Knowledge Bases30 May 2024
- 2024Prompt-based Code Completion via Multi-Retrieval Augmented Generation13 May 2024
- 2024CLAP: Learning Transferable Binary Code Representations with Natural Language Supervision26 Feb 2024