Skip to Main content Skip to Navigation
Conference papers

Dynamic Branch Resolution based on Combined Static Analyses

Abstract : 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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Friday, December 22, 2017 - 10:54:59 AM
Last modification on : Friday, June 19, 2020 - 3:35:33 AM


Files produced by the author(s)


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


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⟩



Record views


Files downloads