Static Analysis of Binary Code with Memory Indirections Using Polyhedra
In this paper we propose a new abstract domain for static analysis of binary code. Our motivation stems from the need to improve the precision of the estimation of the Worst-Case Execution Time (WCET) of safety-critical real-time code. WCET estimation requires computing information such as upper bounds on the number of loop iterations, unfeasible execution paths, etc. These estimations are usually performed on binary code, mainly to avoid making assumptions on how the compiler works. Our abstract domain, based on polyhedra and on two mapping functions that associate polyhedra variables with registers and memory, targets the precise computation of such information. We prove the correctness of the method, and demonstrate its effectiveness on benchmarks and examples from typical embedded code.
|Static Analysis of Binary Code with Memory Indirections Using Polyhedra (Slides.pdf)||587KiB|
Sun 13 Jan Times are displayed in time zone: (GMT+01:00) Greenwich Mean Time : Belfast change
|11:00 - 11:30|
Clément Ballabriga, Julien Forget, Laure GonnordUniversity of Lyon & LIP, France, Giuseppe Lipari, Jordy RuizFile Attached
|11:30 - 12:00|
|12:00 - 12:30|