Talks and Poster Presentations (with Proceedings-Entry):

A. Prantl:
"A Declarative Approach to finding Timing Constraints in High-level Program Representations";
Talk: Workshop on Resource Analysis, University of Hertfordshire, Hatfield, UK; 2008-09-09; in: "Workshop on Resource Analysis", (2008), 2 pages.

English abstract:
Upper bounds for the iteration counts of loop constructs are an
indispensable prerequisite for the static analysis of the timing
behaviour of computer programs. While reasoning about the timing
behaviour is only sensible on the machine code level, many of the
necessary preceding analyses can more naturally be performed on a
higher-level program representation, such as the source code. The most
compelling reason for this is that a lot of information is lost during
the compilation and can only be recovered from the machine code with
high effort, if at all. This idea has been realized in TuBound
\cite{PrantlWCET08}, a new tool for worst-case execution time (WCET)
analysis, developed at TU Vienna. TuBound embraces this high-level
approach by performing program optimizations as well as program
analyses directly on the abstract syntax tree (AST) of the source code
of the program.

In this talk, we will focus on the static analysis components of
TuBound, which are generated from declarative specifications.

Created from the Publication Database of the Vienna University of Technology.