Metraipolis › archive › dc_a810fd2261fc
N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching — arXiv:2608.10043
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.10043
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:22:10.878Z
- SHA-256 of the archived text
9a4ec29baac46d82d031cec20bac74eebf12c4c4acfa91b5f7c017189bc2ac34- Stable URL of this page
https://metraipolis.com/documento/dc_a810fd2261fc
How to cite
N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching — arXiv:2608.10043 — arXiv (en), https://arxiv.org/abs/2608.10043 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a810fd2261fc (Metraipolis archive dc_a810fd2261fc, sha256 9a4ec29baac46d82d031cec20bac74eebf12c4c4acfa91b5f7c017189bc2ac34)
BibTeX
@misc{dca810fd2261fc,
title = {N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching — arXiv:2608.10043},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.10043},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a810fd2261fc; sha256 9a4ec29baac46d82d031cec20bac74eebf12c4c4acfa91b5f7c017189bc2ac34},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10043. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Program-level Binary Code Similarity Analysis (BCSA) aims to identify semantically similar code regions across binary programs, serving as a fundamental technique for software plagiarism detection, vulnerability search, and malware analysis. Existing approaches often decompose binaries into modules following the structure of function call graphs (FCGs) and then match these modules by their contained functions. However, function inlining changes both FCG structures and binary function semantics, making existing decomposition and module matching methods less effective. In this work, we propose N2NMatcher, an inlining-resilient framework for binary decomposition and module matching. We first conduct an empirical study to examine whether binaries still contain functions that provide stable module boundaries across compilation settings. N2NMatcher learns to predict such functions as anchors using a hierarchical graph neural network that encodes binary ACFG-FCG representations built from opcode sequences, control-flow structures, and FCG calling context. It then performs anchor-bounded decomposition and matches the generated modules using learned module graph embeddings. Experimental results show that N2NMatcher improves both the decomposition quality and module matching accuracy compared to existing works, enabling more effective program-level BCSA. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-12 in cs.SE). Categorie arXiv: Software Engineering (cs.SE). Pagina del lavoro: https://arxiv.org/abs/2608.10043 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T06:14:48.471Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).