DOE OSTI · 1664640
Using modularity to segment binary code
Abstract
We consider the problem of recovering program structure from compiled binary code. We first extract the call graph and layout of functions in memory from the compiled code and represent this information in a graphical format. We then employ Louvain's modularity algorithm to identify clusters of functions that are considered to be related. We find that the quality and properties of clusters extracted by our technique are greatly impacted by the relative importance we assign to the call graph and the ordering of functions in memory.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Skryzalin, Jacek, Chivers, Daniel. 2020-09-10. Using modularity to segment binary code. https://doi.org/10.2172/1664640. https://searchnasa.com/record/osti%3A1664640/using-modularity-to-segment-binary-code
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.