Static Analysis Of Binary Code With Memory Indirections Using Polyhedra

Clément Ballabriga (1) , Julien Forget (1) , Laure Gonnord (2, 3, 4) , Giuseppe Lipari (1) , Jordy Ruiz (1)

1 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
2 LIP - Laboratoire de l'Informatique du Parallélisme
3 CASH - CASH - Compilation and Analysis, Software and Hardware
4 UCBL - Université Claude Bernard Lyon 1

In this paper we propose a new abstract domain for staticanalysis 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.

Mots clés: binary analysis; Worst-case Execution Time WCET; polyhedra

Domaines: Informatique et langage [cs.CL]; Algorithme et structure de données [cs.DS]; Systèmes embarqués

Clément Ballabriga, Julien Forget, Laure Gonnord, Giuseppe Lipari, Jordy Ruiz. Static Analysis Of Binary Code With Memory Indirections Using Polyhedra. VMCAI'19 - International Conference on Verification, Model Checking, and Abstract Interpretation, Jan 2019, Cascais, Portugal. pp.114-135, ⟨10.1007/978-3-030-11245-5_6⟩. ⟨hal-01939659⟩