Logotype Mälardalenn University

MRTC publications



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

Full text:  
Authors: Andreas Ermedahl (former), Christer Sandberg (former), Jan Gustafsson, Stefan Bygde, Björn Lisper
Source: Seventh International Workshop on Worst-Case Execution Time Analysis, (WCET'2007), Pisa, Italy
Notes: Best paper award
 

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 entry

@inproceedings{Ermedahl_1317:2007,
   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},
   booktitle = {Seventh International Workshop on Worst-Case Execution Time Analysis, (WCET'2007)},
   month = {July},
   year = {2007},
   url = {http://www.mrtc.mdh.se/index.php?choice=publications&id=1317},
}

  • Mälardalen University |
  • Box 883 |
  • 721 23 Västerås/Eskilstuna |
  • 021-101300, 016-153600 |
  • webmaster |
  • Latest update: 2012.08.24