2026-07-21T19:38:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1194 2024-03-06T10:28:26Z ddc:004 open_access

Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis Ermedahl, Andreas Sandberg, Christer Gustafsson, Jan Bygde, Stefan Lisper, Björn WCET analysis loop-bound analysis program slicing abstract interpretation invariant analysis 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Andreas Ermedahl and Christer Sandberg and Jan Gustafsson and Stefan Bygde and Björn Lisper 2007 Is Part Of OASIcs, Volume 6, 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07) (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2007.1194 urn:nbn:de:0030-drops-11946 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2007.1194 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode