Dynamic Branch Resolution based on Combined Static Analyses - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Dynamic Branch Resolution based on Combined Static Analyses

Résumé

Static analysis requires the full knowledge of the overall program structure. The structure of a program can be represented by a Control Flow Graph (CFG) where vertices are basic blocks (BB) and edges represent the control flow between the BB. To construct a full CFG, all the BB as well as all of their possible targets addresses must be found. In this paper, we present a method to resolve dynamic branches, that identifies the target addresses of BB created due to the switch-cases and calls on function pointers. We also implemented a slicing method to speed up the overall analysis which makes our approach applicable on large and realistic real-time programs.
Fichier principal
Vignette du fichier
sun_18774.pdf (346.67 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01671350 , version 1 (22-12-2017)

Identifiants

  • HAL Id : hal-01671350 , version 1
  • OATAO : 18774

Citer

Wei-Tsun Sun, Hugues Cassé. Dynamic Branch Resolution based on Combined Static Analyses. 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016) in conjunction with ECRTS, Jul 2016, Toulouse, France. pp. 1-10. ⟨hal-01671350⟩
55 Consultations
34 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More