License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2016.8
URN: urn:nbn:de:0030-drops-69014
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6901/
Sun, Wei-Tsun ;
Cassé, Hugues
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.
BibTeX - Entry
@InProceedings{sun_et_al:OASIcs:2016:6901,
author = {Wei-Tsun Sun and Hugues Cass{\'e}},
title = {{Dynamic Branch Resolution Based on Combined Static Analyses}},
booktitle = {16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)},
pages = {8:1--8:10},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-025-5},
ISSN = {2190-6807},
year = {2016},
volume = {55},
editor = {Martin Schoeberl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6901},
URN = {urn:nbn:de:0030-drops-69014},
doi = {10.4230/OASIcs.WCET.2016.8},
annote = {Keywords: WCET, static analysis, dynamic branch, assembly, machine language}
}
|
Keywords: |
|
WCET, static analysis, dynamic branch, assembly, machine language |
|
Collection: |
|
16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
20.12.2016 |
