OASIcs.WCET.2007.1193.pdf
- Filesize: 318 kB
- 6 pages
Document
Data-Flow Based Detection of Loop Bounds
Authors
-
Part of:
Volume:
7th International Workshop on Worst-Case Execution Time Analysis (WCET'07) (WCET 2007)
Series: Open Access Series in Informatics (OASIcs)
Conference: Workshop on Worst-Case Execution Time Analysis (WCET) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2007-11-13
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)
https://doi.org/10.4230/OASIcs.WCET.2007.1193
https://doi.org/10.4230/OASIcs.WCET.2007.1193
Abstract
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.
Keywords
- WCET analysis
- loop bound detection
- flow analysis
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads