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.3
URN: urn:nbn:de:0030-drops-68966
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6896/
Mussot, Vincent ; Ruiz, Jordy ; Sotin, Pascal ; de Michiel, Marianne ; Cassé, Hugues
Expressing and Exploiting Conflicts over Paths in WCET Analysis
| pdf-format: |
|
Abstract
The presence of infeasible paths in a program is a source of imprecision in the Worst-Case Execution Time (WCET) analysis. Detecting, expressing and exploiting such paths can improve the WCET estimation or, at least, improve the confidence we have in estimation precision. In this article, we propose an extension of the FFX format to express conflicts over paths and we detail two ways of enhancing the WCET analyses with that information. We demonstrate and compare these techniques on the Mälardalen benchmark suite and on C code generated from Esterel.
BibTeX - Entry
@InProceedings{mussot_et_al:OASIcs:2016:6896,
author = {Vincent Mussot and Jordy Ruiz and Pascal Sotin and Marianne de Michiel and Hugues Cass{\'e}},
title = {{Expressing and Exploiting Conflicts over Paths in WCET Analysis}},
booktitle = {16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)},
pages = {3:1--3:11},
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/6896},
URN = {urn:nbn:de:0030-drops-68966},
doi = {10.4230/OASIcs.WCET.2016.3},
annote = {Keywords: WCET analysis, Infeasible paths, Path conflicts, IPET, CFG transformation}
}
| Keywords: | WCET analysis, Infeasible paths, Path conflicts, IPET, CFG transformation | |
| Seminar: | 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 20.12.2016 |
