Abstract Interpretation of Binary Code with Memory Accesses using Polyhedra
Abstract
In this paper we propose a novel methodology for static analysis of binary code using abstract interpretation. We use an abstract domain based on polyhedra and two mapping functions that associate polyhedra variables with registers and memory. We demonstrate our methodology to the problem of computing upper bounds to loop iterations in the code. This problem is particularly important in the domain of Worst-Case Execution Time (WCET) analysis of safety-critical real-time code. However, our approach is general and it can applied to other static analysis problems.
Cite
@article{arxiv.1711.07257,
title = {Abstract Interpretation of Binary Code with Memory Accesses using Polyhedra},
author = {Clément Ballabriga and Julien Forget and Giuseppe Lipari},
journal= {arXiv preprint arXiv:1711.07257},
year = {2017}
}
Comments
An earlier version of this paper has been submitted to TACAS 2018 (http://www.etaps.org/index.php/2018/tacas) for peer-review. Compared to the submitted paper, this version contains more up-to-date benchmarks in Section 6