2026-07-23T22:21:20Z https://drops.dagstuhl.de/oai

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

Towards Symbolic State Traversal for Efficient WCET Analysis of Abstract Pipeline and Cache Models Wilhelm, Stephan Wachter, Björn WCET worst-case execution time hard real-time embedded systems abstract interpretation pipeline analysis cache analysis symbolic state traversal BDD Static program analysis is a proven approach for obtaining safe and tight upper bounds on the worst-case execution time (WCET) of program tasks. It requires an analysis on the microarchitectural level, most notably pipeline and cache analysis. In our approach, the integrated pipeline and cache analysis operates on sets of possible abstract hardware states. Due to the growth of CPU complexity and the existence of timing anomalies, the analysis must handle an increasing number of possible abstract states for each program point. Symbolic methods have been proposed as a way to reduce memory consumption and improve runtime in order to keep pace with the growing hardware complexity. This paper presents the advances made since the original proposal and discusses a compact representation of abstract caches for integration with symbolic pipeline analysis. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stephan Wilhelm and Björn Wachter 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.1190 urn:nbn:de:0030-drops-11904 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2007.1190 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode