Static Analysis Of Binary Code With Memory Indirections Using Polyhedra

Abstract : In this paper we propose a new abstract domain for static analysis of binary code. Our motivation stems from the need to im- prove 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.
Type de document :
Communication dans un congrès
International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'19), Jan 2019, Lisbon, Portugal
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01939659
Contributeur : Laure Gonnord <>
Soumis le : jeudi 29 novembre 2018 - 16:09:58
Dernière modification le : mardi 18 décembre 2018 - 09:45:50

Fichier

vmcai19_binary_cr_authorversio...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01939659, version 1

Collections

Citation

Clément Ballabriga, Julien Forget, Laure Gonnord, Giuseppe Lipari, Jordy Ruiz. Static Analysis Of Binary Code With Memory Indirections Using Polyhedra. International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'19), Jan 2019, Lisbon, Portugal. 〈hal-01939659〉

Partager

Métriques

Consultations de la notice

113

Téléchargements de fichiers

96