License
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2007.1193
URN: urn:nbn:de:0030-drops-11934
URL: http://drops.dagstuhl.de/opus/volltexte/2007/1193/
Go to the corresponding Portal


Cullmann, Christoph ; Martin, Florian

Data-Flow Based Detection of Loop Bounds

pdf-format:
Document 1.pdf (318 KB)


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.

BibTeX - Entry

@InProceedings{cullmann_et_al:OASIcs:2007:1193,
  author =	{Christoph Cullmann and Florian Martin},
  title =	{{Data-Flow Based Detection of Loop Bounds}},
  booktitle =	{7th International Workshop on Worst-Case Execution Time Analysis (WCET'07)},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-05-7},
  ISSN =	{2190-6807},
  year =	{2007},
  volume =	{6},
  editor =	{Christine Rochange},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1193},
  URN =		{urn:nbn:de:0030-drops-11934},
  doi =		{http://dx.doi.org/10.4230/OASIcs.WCET.2007.1193},
  annote =	{Keywords: WCET analysis, loop bound detection, flow analysis}
}

Keywords: WCET analysis, loop bound detection, flow analysis
Seminar: 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07)
Issue Date: 2007
Date of publication: 13.11.2007


DROPS-Home | Fulltext Search | Imprint Published by LZI