Sciweavers

83 search results - page 1 / 17
» Bounding Loop Iterations for Timing Analysis
Sort
View
RTAS
1998
IEEE
13 years 9 months ago
Bounding Loop Iterations for Timing Analysis
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
Christopher A. Healy, Mikael Sjödin, Viresh R...
WCET
2007
13 years 6 months ago
Data-Flow Based Detection of Loop Bounds
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
Christoph Cullmann, Florian Martin
WCET
2003
13 years 6 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
ICDCIT
2005
Springer
13 years 10 months ago
Analyzing Loop Paths for Execution Time Estimation
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
Abhik Roychoudhury, Tulika Mitra, Hemendra Singh N...
LPAR
2010
Springer
13 years 3 months ago
ABC: Algebraic Bound Computation for Loops
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
Régis Blanc, Thomas A. Henzinger, Thibaud H...