Recovering memory access patterns of executable programs
Under an Elsevier user license
open archive
Highlights
► We show how to parse binary programs and build a formal model of how they use memory. ► The paper focuses on loops and access functions. It explains how to obtain linear access functions, and loops with linear bounds. ► The efficacy of the approach is evaluated on almost 40 benchmark programs. ► One immediate application is the optimization of memory tracing. ► We also describe some applications to automatic parallelization of binary code.
Keywords
Memory accesses
Binary analysis
Decompilation
Static single assignment
Memory tracing
Program skeletonization
Automatic parallelization
Cited by (0)
Copyright © 2012 Elsevier B.V. All rights reserved.