Data-Flow Based Detection of Loop Bounds

Authors Christoph Cullmann, Florian Martin

Thumbnail PDF


  • Filesize: 318 kB
  • 6 pages

Document Identifiers

Author Details

Christoph Cullmann
Florian Martin

Cite AsGet BibTex

Christoph Cullmann and Florian Martin. Data-Flow Based Detection of Loop Bounds. In 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07). Open Access Series in Informatics (OASIcs), Volume 6, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


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 bounds is difficult and time consuming, the WCET analyzer aiT originally developed by Saarland University and AbsInt GmbH uses static analysis to determine the needed bounds as far as possible. This paper describes a novel data-flow based analysis for aiT to calculate the needed loop bounds on the assembler level. The new method is compared with a pattern based loop analysis already in use by this tool.
  • WCET analysis
  • loop bound detection
  • flow analysis


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads