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

Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis using Abstract Execution

Fulltext:


Authors:

Jan Gustafsson, Andreas Ermedahl, Christer Sandberg, Björn Lisper

Research group:

Programming Languages

Publication Type:

Conference/Workshop Paper

Venue:

The 27th IEEE Real-Time Systems Symposium (RTSS 2006)

Abstract

Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component for statically deriving safe and tight WCET bounds is information on the possible program flow through the program. Such flow information can be provided manually by user annotations, or automatically by a flow analysis. To make WCET analysis as simple and safe as possible, it should preferably be automatically derived, with no or very limited user interaction. In this paper we present a method for deriving such flow information called abstract execution. This method can automatically calculate loop bounds, bounds for including nested loops, as well as many types of infeasible paths. Our evaluations show that it can calculate WCET estimates automatically, without any user annotations, for a range of benchmark programs, and that our techniques for nested loops and infeasible paths sometimes can give substantially better WCET estimates than using loop bounds analysis only.

Bibtex

@inproceedings{Gustafsson995,
author = {Jan Gustafsson and Andreas Ermedahl and Christer Sandberg and Bj{\"o}rn Lisper},
title = {Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis using Abstract Execution},
month = {December},
year = {2006},
booktitle = {The 27th IEEE Real-Time Systems Symposium (RTSS 2006)},
url = {http://www.es.mdu.se/publications/995-}
}