OASIcs.WCET.2008.1658.pdf
- Filesize: 104 kB
- 11 pages
Document
Merging Techniques for Faster Derivation of WCET Flow Information using Abstract Execution
Authors
-
Part of:
Volume:
8th International Workshop on Worst-Case Execution Time Analysis (WCET'08) (WCET 2008)
Series: Open Access Series in Informatics (OASIcs)
Conference: Workshop on Worst-Case Execution Time Analysis (WCET) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2008-11-13
Cite AsGet BibTex
Jan Gustafsson and Andreas Ermedahl. Merging Techniques for Faster Derivation of WCET Flow Information using Abstract Execution. In 8th International Workshop on Worst-Case Execution Time Analysis (WCET'08). Open Access Series in Informatics (OASIcs), Volume 8, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/OASIcs.WCET.2008.1658
https://doi.org/10.4230/OASIcs.WCET.2008.1658
Abstract
Static Worst-Case Execution Time (WCET) analysis derives upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths. We have previously introduced abstract execution (AE), a method capable of deriving very precise flow information. This paper present different merging techniques that can be used by AE for trading analysis time for flow information precision. It also presents a new technique, ordered merging, which may radically shorten AE analysis times, especially when analyzing large programs with many possible input variable values.
Keywords
- Worst-Case Execution Time (WCET) analysis
- flow analysis
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads