Expressing and Exploiting Conflicts over Paths in WCET Analysis
Infeasible paths
WCET analysis
ddc:004
Path conflicts
IPET
CFG transformation
DOI:
10.4230/oasics.wcet.2016.3
Publication Date:
2016-01-01
AUTHORS (5)
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 Malardalen benchmark suite and on C code generated from Esterel.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....