This paper presents a framework for combining low-level measurement data through high-level static analysis techniques on instrumented programs in order to generate WCET estimates, for which we introduce the instrumentation point graph (IPG). We present the notion of iteration edges, which are the most important property of the IPG from a timing analysis perspective since they allow more path-based information to be integrated into tree-based calculations on loops. The main focus of this paper, however, is an algorithm that performs a hierarchical decomposition of an IPG into an Itree to permit tree-based WCET calculations. The Itree representation supports a novel high-level structure, the meta-loop, which enables iteration edges to be merged in the calculation stage. The timing schema required for the Itree is also presented. Finally, we outline some conclusions and future areas of interest.

BibTex Entry

@inproceedings{Betts2006,
 author = {A. Betts and G. Bernat},
 booktitle = {Proceedings of the 9th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC)},
 month = {April},
 organization = {Computer Society, IEEE},
 publisher = {IEEE},
 title = {Tree-Based WCET Analysis on Instrumentation Point Graphs},
 year = {2006}
}