A number of methods have been presented to calculate the worst case execution time (WCET) of real-time programs. However, to properly handle semantic dependencies, which in most cases is needed to reduce overestimation, all these methods require extra semantic information to be given by the programmer (manual annotations for paths, loops and recursion depth). To manually derive these annotations is often difficult and the process is error-prone. In this paper we present a new method to automatically derive safe and tight annotations for paths and loops. We illustrate our method by giving some examples and by presenting a prototype tool, implementing the method for a subset of C.
CITATION STYLE
Ermedahl, A., & Gustafsson, J. (1997). Deriving annotations for tight calculation of execution time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 1298–1307). Springer Verlag. https://doi.org/10.1007/bfb0002886
Mendeley helps you to discover research relevant for your work.