Talks and Poster Presentations (with Proceedings-Entry):
J. Knoop, L. Kovacs, J. Zwirchmayr:
"An Evaluation of WCET Analysis using Symbolic Loop Bounds";
Talk: 11th International Workshop on Worst-Case Execution-Time Analysis,
2011-07-05; in: "Proc. 11'th International Workshop on Worst-Case Execution Time Analysis",
C. Healy (ed.);
Österreichische Computer Gesellschaft - OCG,
In this paper we evaluate a symbolic loop bound generation technique
recently proposed by the authors in  (PSI11). The technique deploys pattern-based recurrence solving in conjunction with program flow refinement using SMT reasoning. The derived bounds are further used in the WCET analysis of programs with loops. This paper presents experimental evaluations of the method carried out with the r-TuBound software tool. We evaluate our method against various academic and industrial WCET benchmarks, and outline further challenges for
symbolic loop bound computation.
WCET, loop bounds, upper bounds, wcet benchmarks, wcet analysis, static analysis
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.