Formal Verification of Loop Bound Estimation for WCET Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Formal Verification of Loop Bound Estimation for WCET Analysis


Worst-case execution time (WCET) estimation tools are complex pieces of software performing tasks such as computation on control flow graphs (CFGs) and bound calculation. In this paper, we present a formal verification (in Coq) of a loop bound estimation. It relies on program slicing and bound calculation. The work has been integrated into the CompCert verified C compiler. Our verified analyses directly operate on non-structured CFGs. We extend the CompCert RTL intermediate language with a notion of loop nesting (a.k.a. weak topological ordering on CFGs) that is useful for reasoning on CFGs. The automatic extraction of our loop bound estimation into OCaml yields a program with competitive results, obtained from experiments on a reference benchmark for WCET bound estimation tools.
Fichier principal
Vignette du fichier
paper.pdf (1.82 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00848703 , version 1 (28-07-2013)


  • HAL Id : hal-00848703 , version 1


Sandrine Blazy, André Maroneze, David Pichardie. Formal Verification of Loop Bound Estimation for WCET Analysis. VSTTE - Verified Software: Theories, Tools and Experiments, Natarajan Shankar, May 2013, Menlo Park, United States. pp.281-303. ⟨hal-00848703⟩
282 View
297 Download


Gmail Facebook X LinkedIn More