| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875379 | Science of Computer Programming | 2014 | 17 Pages |
Abstract
⺠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
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alain Ketterlin, Philippe Clauss,