LibXSub introduces an explainable subgraph generation mechanism that identifies critical call relationships through edge masks and characterizes the contribution of different function feature dimensions to region similarity prediction through node feature masks, demonstrating the effectiveness of the proposed framework for both region-level third-party library reuse detection and result interpretation.
Abstract
Binary third-party library detection is a fundamental task in software composition analysis, vulnerability tracing, and software supply chain security. Existing approaches mainly rely on function-level matching or global similarity computation, while paying insufficient attention to region-level reuse structures formed by function call relationships. Moreover, their detection results generally lack interpretability. To address these limitations, this paper proposes LibXSub, an explainable subgraph-based framework for binary third-party library reuse region detection. Based on function call graphs, LibXSub integrates instruction operation features and control-flow structural features of function nodes, and employs a Siamese graph neural network to compute the structural-semantic similarity between target candidate regions and candidate library regions, enabling region-level third-party library reuse detection. To improve interpretability, LibXSub introduces an explainable subgraph generation mechanism that identifies critical call relationships through edge masks and characterizes the contribution of different function feature dimensions to region similarity prediction through node feature masks. Experimental results show that LibXSub achieves F1-scores of 0.900 and 0.877 on Dataset_1 and Dataset_2, respectively, outperforming existing methods. Furthermore, it generates compact explanatory subgraphs while maintaining high explanation fidelity, demonstrating the effectiveness of the proposed framework for both region-level third-party library reuse detection and result interpretation.
Third-party libraries (TPLs) are widely used in Android apps, but their reuse can introduce security risks and interfere with downstream program analyses. Existing Android TPL detection approaches face two key limitations: their hand-crafted features are fragile under aggressive code transformations, and their whole-li...
Di-Hao Fan, Jian Zhang, Ya-Sai Shi et al.· 0 citations
FiCoVuL is presented, a framework for analyzing interconnected functions and providing fine-grained guidance for vulnerability fixing that significantly outperforms other methods in both vulnerability detection and localization.
Hong-Jun Huang, Fu-Tai Zou, Jia-Ping Gui et al.· ACM Transactions on Software...· 0 citations
Results indicate that VulSCG improves detection effectiveness while maintaining scalability, since it complements inter-procedural semantics through compact SummaryNodes rather than full callee graph expansion.
Rui-Guo Hu, Dong-Qi Wang, Shu-Jin Yang et al.· Companion Proceedings of the...· 0 citations
Athea, the first graph-based approach for vulnerability affected library identification, is proposed, which models vulnerability databases as a knowledge graph and reformulates the identification problem as knowledge graph completion (KGC).
P. Duy, Trang Dang Yen, Hưng Nguyễn Hữu et al.· 0 citations
Binary Code Similarity Detection (BCSD) is a foundational capability in software security, underpinning critical applications ranging from vulnerability detection to malware analysis. While recent tools based on Machine Learning (ML) have achieved significant performance improvements, their efficacy is heavily continge...
Teng-Teng Yang, Yi-Kun Hu, Ji-Can Zhang et al.· Proceedings of the ACM on So...· 0 citations
Detecting third-party libraries (TPLs) in C/C++ binaries is essential for software supply chain security, enabling vulnerability identification and license compliance. Existing methods predominantly rely on similarity matching: extracting features from binaries and comparing them against library databases. However, sim...
Cheng-Yue Liu, Zheng-Zi Xu, Lyuye Zhang et al.· Proceedings of the ACM on So...· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comJul 13, 2026
Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduJul 6, 2026
PhD student Rachel Sava, winner of the Envisioning the Future of Computing Prize, explores transformative improvements and dystopian risks of neural technology.
Microsoft Research Blog· microsoft.comOct 21, 2026
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.