You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Deriving Annotations for Tight Calculation of Execution Time

Fulltext:


Authors:

Andreas Ermedahl, Jan Gustafsson

Research group:

Programming Languages

Publication Type:

Conference/Workshop Paper

Venue:

Euro-Par97, LNCS 1300

Abstract

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.

Bibtex

@inproceedings{Ermedahl841,
author = {Andreas Ermedahl and Jan Gustafsson},
title = {Deriving Annotations for Tight Calculation of Execution Time},
pages = {1298--1307},
month = {August},
year = {1997},
booktitle = {Euro-Par97, LNCS 1300},
url = {http://www.es.mdu.se/publications/841-}
}