The reviewed record of science sign in
Pith

arxiv: 2410.18561 · v1 · pith:Z2UPUBB7 · submitted 2024-10-24 · cs.SE

Binary Code Similarity Detection via Graph Contrastive Learning on Intermediate Representations

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:Z2UPUBB7record.jsonopen to challenge →

classification cs.SE
keywords bcsdcodecompilationdetectionfunctionbinarycontrastivedifferences
0
0 comments X
read the original abstract

Binary Code Similarity Detection (BCSD) plays a crucial role in numerous fields, including vulnerability detection, malware analysis, and code reuse identification. As IoT devices proliferate and rapidly evolve, their highly heterogeneous hardware architectures and complex compilation settings, coupled with the demand for large-scale function retrieval in practical applications, put forward higher requirements for BCSD methods. In this paper, we propose IRBinDiff, which mitigates compilation differences by leveraging LLVM-IR with higher-level semantic abstraction, and integrates a pre-trained language model with a graph neural network to capture both semantic and structural information from different perspectives. By introducing momentum contrastive learning, it effectively enhances retrieval capabilities in large-scale candidate function sets, distinguishing between subtle function similarities and differences. Our extensive experiments, conducted under varied compilation settings, demonstrate that IRBinDiff outperforms other leading BCSD methods in both One-to-one comparison and One-to-many search scenarios.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Beyond the Edge of Function: Unraveling the Patterns of Type Recovery in Binary Code

    cs.CR 2025-03 unverdicted novelty 6.0

    ByteTR recovers variable types in binary code more effectively than prior methods by decoupling unbalanced type sets, mitigating compiler optimization effects via static analysis, and modeling inter-procedural data fl...