Using SMT Solving for the Lookup of Infeasible Paths in Binary Programs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Using SMT Solving for the Lookup of Infeasible Paths in Binary Programs

Résumé

Worst-Case Execution Time (WCET) is a key component to check temporal constraints of realtime systems. WCET by static analysis provides a safe upper bound. While hardware modelling is now efficient, loss of precision stems mainly in the inclusion of infeasible execution paths in the WCET calculation. This paper proposes a new method to detect such paths based on static analysis of machine code and the feasibility test of conditions using Satisfiability Modulo Theory (SMT) solvers. The experimentation shows promising results although the expected precision was slightly lowered due to clamping operations needed to cope with complexity explosion. An important point is that the implementation has been performed in the OTAWA framework and is independent of any instruction set thanks to its semantic instructions.
Fichier principal
Vignette du fichier
ruiz_15319.pdf (208.3 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-01371783 , version 1 (27-09-2016)

Identifiants

  • HAL Id : hal-01371783 , version 1
  • OATAO : 15319

Citer

Jordy Ruiz, Hugues Cassé. Using SMT Solving for the Lookup of Infeasible Paths in Binary Programs. 15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015), Jul 2015, Lund, Sweden. pp. 95-104. ⟨hal-01371783⟩
257 Consultations
72 Téléchargements

Partager

Gmail Facebook X LinkedIn More