Sign inGet started
Paper · arXiv

Pretraining on Call Graphs: When Binary Analysis Tasks Profit From Context

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, w...

AuthorsSamuel Valenzuela, Johannes Kinder
Primary categorycs.SE
Published3 August 2026
Last updated at source3 August 2026
cs.SEcs.CRcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/dbc35bcc-3648-4603-a555-2dea8cb59642" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.