License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2005.816
URN: urn:nbn:de:0030-drops-8163
Go to the corresponding OASIcs Volume Portal

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

Exploiting Branch Constraints without Exhaustive Path Enumeration

WCET_05.Chen.816.pdf (0.3 MB)


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.

BibTeX - Entry

  author =	{Chen, Ting and Mitra, Tulika and Roychoudhury, Abhik and Suhendra, Vivy},
  title =	{{Exploiting Branch Constraints without Exhaustive Path Enumeration}},
  booktitle =	{5th International Workshop on Worst-Case Execution Time Analysis (WCET'05)},
  pages =	{46--49},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-24-8},
  ISSN =	{2190-6807},
  year =	{2007},
  volume =	{1},
  editor =	{Wilhelm, Reinhard},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-8163},
  doi =		{10.4230/OASIcs.WCET.2005.816},
  annote =	{Keywords: WCET, infeasible path, branch constraints}

Keywords: WCET, infeasible path, branch constraints
Collection: 5th International Workshop on Worst-Case Execution Time Analysis (WCET'05)
Issue Date: 2007
Date of publication: 29.03.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI