Name
Abstract | ||
|---|---|---|
The worst-case execution time analyzer aiT originally developed by Saarland University and AbsInt GmbH computes safe and precise upper bounds for the WCETs of tasks. It relies on a pipeline model that usually has been handcrafted.We present some new approaches aiming at automatically obtaining a pipeline model as required by aiT from a formal processor description in VHDL or Verilog. The derivation of the total WCET from the basic-block WCETs requires knowledge about upper bounds on the number of loop iterations. We present a new method for loop bound detection using dataflow analysis to derive loop invariants. A task may contain infeasible paths caused by conditionals with logically related conditions. We present a static analysis that identifies and collects conditions from the executable, and relates these collections to detect infeasible paths. This new analysis uses the results of a novel generic slicer on the level of binary code. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-71322-7_2 | Program Analysis and Compilation |
Keywords | Field | DocType |
dataflow analysis,wcet analysis,new method,loop invariants,new development,pipeline model,new approach,infeasible path,loop iteration,new analysis,basic-block wcets,static analysis,upper bound,worst case execution time | Programming language,Computer science | Conference |
Volume | ISSN | ISBN |
4444 | 0302-9743 | 3-540-71315-8 |
Citations | PageRank | References |
12 | 0.80 | 11 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Ferdinand | 1 | 12 | 0.80 |
| Florian Martin | 2 | 590 | 53.16 |
| Christoph Cullmann | 3 | 66 | 6.06 |
| Marc Schlickling | 4 | 144 | 7.27 |
| Ingmar Stein | 5 | 25 | 1.53 |
| Stephan Thesing | 6 | 1245 | 59.28 |
| Reinhold Heckmann | 7 | 1529 | 94.73 |