OASIcs.WCET.2005.816.pdf
- Filesize: 280 kB
- 4 pages
Document
Exploiting Branch Constraints without Exhaustive Path Enumeration
Authors
-
Part of:
Volume:
5th International Workshop on Worst-Case Execution Time Analysis (WCET'05) (WCET 2005)
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: 2007-03-29
Cite AsGet BibTex
Ting Chen, Tulika Mitra, Abhik Roychoudhury, and Vivy Suhendra. Exploiting Branch Constraints without Exhaustive Path Enumeration. In 5th International Workshop on Worst-Case Execution Time Analysis (WCET'05). Open Access Series in Informatics (OASIcs), Volume 1, pp. 46-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/OASIcs.WCET.2005.816
https://doi.org/10.4230/OASIcs.WCET.2005.816
Abstract
Statically estimating the worst case execution time
(WCET) of a program is important for real-time software.
This is difficult even in the programming language
level due to the inherent difficulty in detecting and exploiting
infeasible paths in a program’s control flow graph. In
this paper, we propose an efficient method to exploit infeasible
path information for WCET estimation of a loop
without resorting to exhaustive path enumeration. The ef-
ficiency of our approach is demonstrated with a real-life
control-intensive program.
Keywords
- WCET
- infeasible path
- branch constraints
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads