Document Open Access Logo

Exploiting Branch Constraints without Exhaustive Path Enumeration

Authors Ting Chen, Tulika Mitra, Abhik Roychoudhury, Vivy Suhendra



PDF
Thumbnail PDF

File

OASIcs.WCET.2005.816.pdf
  • Filesize: 280 kB
  • 4 pages

Document Identifiers

Author Details

Ting Chen
Tulika Mitra
Abhik Roychoudhury
Vivy Suhendra

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail