10.4230/OASICS.WCET.2006.667
Gustaffson, Jan
Jan
Gustaffson
Ermedahl, Andreas
Andreas
Ermedahl
Lisper, Björn
Björn
Lisper
Algorithms for Infeasible Path Calculation
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2006
Article
Worst case execution time
real-time
control flow analysis
abstract interpretation
infeasible paths
Mueller, Frank
Frank
Mueller
2006
2006-08-23
2006-08-23
2006-08-23
en
urn:nbn:de:0030-drops-6677
10.4230/OASIcs.WCET.2006
978-3-939897-03-3
2190-6807
10.4230/OASIcs.WCET.2006
OASIcs, Volume 4, WCET 2006
6th International Workshop on Worst-Case Execution Time Analysis (WCET'06)
2012
4
4
1
6
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Mueller, Frank
Frank
Mueller
2190-6807
Open Access Series in Informatics (OASIcs)
2006
4
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
6 pages
376147 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. One key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths for the analysed program. Such flow information can be provided as either as annotations by the user, can be automatically calculated by a flow analysis, or by a combination of both. To make the analysis as simple, automatic and safe as possible, this flow information should be calculated automatically with no or very limited user interaction. In this paper we present three novel algorithms to calculate infeasible paths. The algorithms are all designed to be simple and efficient, both in terms of generated flow facts and in analysis running time. The algorithms have been implemented and tested for a set of WCET benchmarks programs.
OASIcs, Vol. 4, 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06), pages 1-6