aiqbench analysis
This research investigates how leveraging call graph context in binary function embeddings impacts performance across reverse engineering tasks, revealing that gains in semantic similarity do not automatically transfer to syntactic detection. The study highlights a critical trade-off where optimizing for semantic robustness can inadvertently degrade performance on syntax-based analyses, offering nuanced insights into model generalization limits within low-level code analysis.
Pretraining on Call Graphs: When Binary Analysis Tasks Profit From Context
arXiv:2608.02084v1 Announce Type: cross Abstract: Binary function embedding models are trained to encode the semantics of binary code in such a way that they can be generalized to a variety of reverse engineering tasks, such as binary code search, vulnerability detection, or malware classification. While many models only take the function in question as contextual input, there have been successful attempts to improve function embeddings by leveraging information from the call graph. In this study, we dissect the implications of these embedding refinements. We conduct experiments using a range of graph-based models on the embeddings generated by two state-of-the-art binary function embedding models. Integrating inter-procedural context, we show that improvements on binary code similarity detection (BCSD) will not necessarily generalize to downstream tasks, neither of semantic nor of syntactic nature. More generally, we find that optimizing for semantic similarity tasks correlates with worse performance on syntactic tasks. By conducting an explanatory analysis on the dataset, we find that the call graph-based enhancements significantly enhance the robustness of embeddings, particularly in scenarios where the initial models struggle. Furthermore, we observe that the added context is more beneficial for namespace-related functions than for those focused on individual logic, confirming that the call graph can be leveraged most effectively in context-dependent scenarios.
Abstract:Binary function embedding models are trained to encode the semantics of binary code in such a way that they can be generalized to a variety of reverse engineering tasks, such as binary code search, vulnerability detection, or malware classification. While many models only take the function in question as contextual input, there have been successful attempts to improve function embeddings by leveraging information from the call graph. In this study, we dissect the implications of these embedding refinements. We conduct experiments using a range of graph-based models on the embeddings generated by two state-of-the-art binary function embedding models. Integrating inter-procedural context, we show that improvements on binary code similarity detection (BCSD) will not necessarily generalize to downstream tasks, neither of semantic nor of syntactic nature. More generally, we find that optimizing for semantic similarity tasks correlates with worse performance on syntactic tasks. By conducting an explanatory analysis on the dataset, we find that the call graph-based enhancements significantly enhance the robustness of embeddings, particularly in scenarios where the initial models struggle. Furthermore, we observe that the added context is more beneficial for namespace-related functions than for those focused on individual logic, confirming that the call graph can be leveraged most effectively in context-dependent scenarios.
12 pages, 5 figures. Accepted at ICPC '26
Software Engineering (cs.SE); Cryptography and Security (cs.CR); Machine Learning (cs.LG)
arXiv:2608.02084 [cs.SE]
(or arXiv:2608.02084v1 [cs.SE] for this version)
https://doi.org/10.48550/arXiv.2608.02084 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
Proceedings of the 34th IEEE/ACM International Conference on Program Comprehension, pp. 14-25, 2026
https://doi.org/10.1145/3794763.3794795 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 336 words
Related coverage

Expenditure Horizon: Measuring Optimization Ability, with an Application to NanoGPT
METR · Jul 21, 2026
[AINews] Reflection Beam - 501B-A23B American Open Model
Latent Space · Oct 6, 2026
Links #5: 2026/07
LessWrong · Jul 31, 2026

How can LLM RL Work Despite Information-Theoretic Inefficiency
LessWrong · Oct 16, 2026