An Evaluation of WCET Analysis using Symbolic Loop Bounds
نویسندگان
چکیده
In this paper we evaluate a symbolic loop bound generation technique recently proposed by the authors in [7]. 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.
منابع مشابه
An automatic parametric approach for WCET analysis of C programs
In this paper, we propose a static worstcase execution time (WCET) analysis approach aimed to automatically extract flow information related to program semantics. This information is used to reduce the overestimation of the calculated WCET. We focus on flow information related to loop bounds and infeasible paths. The approach handles loops with multiple exit conditions and non-rectangular loops...
متن کاملPractical Experiments with Symbolic Loop Bound Computation for WCET Analysis1
We present an automatic method for computing tight upper bounds on the iteration number of special classes of program loops. These upper bounds are further used in the WCET analysis of programs. Program flow is refined using SMT reasoning, rewriting multi-path loops into single-path ones. Single-path loops are further translated into a set of recurrence relations over program variables. To solv...
متن کامل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: expressions that may contain parameters. These parameters may represent, for instance, values of input parameters to the program, or maximal iteration counts for loops. We describe a technique for fully automatic parametri...
متن کاملParametric timing estimation with Newton-Gregory formulae
This paper presents a novel method for parametric worst-case execution time (WCET) estimation of loops. The method determines a parametric bound on the iteration space size of loops with both affine and nonaffine loop bounds in an efficient manner using a formulation based on Newton–Gregory interpolating polynomials. Parametric WCET formulae are used to support dynamic scheduling decisions at r...
متن کاملr-TuBound: Loop Bounds for WCET Analysis (Tool Paper)
We describe the structure and the usage of a new software tool, called r-TuBound, for deriving symbolic loop iteration bounds in the worst-case execution time (WCET) analysis of programs. r-TuBound implements algorithms for pattern-based recurrence solving and program flow refinement, and it was successfully tested on a wide range of examples. The purpose of this article is to illustrate what r...
متن کامل