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

Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis

Fulltext:


Note:

<B>Best paper award</B>

Research group:


Publication Type:

Conference/Workshop Paper

Venue:

Seventh International Workshop on Worst-Case Execution Time Analysis, (WCET2007)


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 static derivation of precise WCET estimates is upper bounds on the number of times different loops can be iterated.In this paper we present an approach for deriving upper loop bounds based on a combination of standard program analysis techniques. The idea is to bound the number of different states in the loop which can influence the exit conditions. Given that the loop terminates, this number provides an upper loop bound.An algorithm based on the approach has been implemented in our WCET analysis tool SWEET. We evaluate the algorithm on a number of standard WCET benchmarks, giving evidence that it is capable to derive valid bounds for many types of loops.

Bibtex

@inproceedings{Ermedahl1112,
author = {Andreas Ermedahl and Christer Sandberg and Jan Gustafsson and Stefan Bygde and Bj{\"o}rn Lisper},
title = {Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis},
note = {\textlessB\textgreaterBest paper award\textless/B\textgreater},
month = {July},
year = {2007},
booktitle = {Seventh International Workshop on Worst-Case Execution Time Analysis, (WCET2007)},
url = {http://www.es.mdh.se/publications/1112-}
}