[ main page ] [ back ]

2006 : Automatic Loop Bound Analysis of Programs written in C

Author(s)
Martin Kirner
Abstract
The knowledge about the worst-case execution time is important for the design of real-time systems. Without a save upper bound for the execution time it cannot be guaranteed that the system will meet all its deadlines. As part of the worst-case execution-time calculation, it is important to know how many times the body of a loop will be executed after entering the loop header for the first time. Traditionally, loop bounds had to be provided explicitly, in the form of source-code annotations to support timing analysis of real-time programs. This thesis presents a method that is able to calculate a lower and an upper bound for the number of iterations of different loop types by analyzing the semantics of a source code, written in the high-level language C. Only if the number of iterations of a loop depends on unknown variable values, annotations about the value bounds have to be given in the source code. The analysis of loops is done at the source code level. For every supported loop, the result of the loop-bound calculation is written back into the source file to support the further steps of the WCET analysis.
Bibtex
@mastersthesis{ kirner:2006,
  author =      "Martin Kirner",
  title =       "Automatic Loop Bound Analysis of Programs written in C",
  address =     "Treitlstr. 3/3/182-1, 1040 Vienna, Austria",
  school =      "Technische Universit{\"a}t Wien, Institut f{\"u}r Technische Informatik",
  year =        "2006"
}
Download
Get kirner_masterthesis_automatic_loop_bound_analysis.pdf - Adobe PDF-format, (639.3877 KB; posted at July 09 2013)


[ main page ] [ back ]