Name
Abstract | ||
|---|---|---|
To reduce complexity while computing an upper bound on the worst-case execution time, static WCET analysis performs over-approximations. This feeds the general feeling that static WCET estimations can be far above the real WCET. This feeling is strengthened when these estimations are compared to measured execution times: generally, it is very unlikely to capture the worstcase from observations, then the difference between the highest watermark and the proven WCET upper bound might be considerable. In this paper, we introduce a framework to quantify the possible overestimation on WCET upper bounds obtained by static analysis. The objective is to derive a lower bound on the WCET to complement the upper bound. |
Year | Venue | Field |
|---|---|---|
2015 | WCET | Upper and lower bounds,Computer science,Static analysis,Parallel computing,Watermark,Real-time computing,Execution time |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hugues Cassé | 1 | 289 | 20.40 |
| Haluk Ozaktas | 2 | 26 | 3.32 |
| Christine Rochange | 3 | 341 | 27.90 |