License
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2005.816
URN: urn:nbn:de:0030-drops-8163
URL: http://drops.dagstuhl.de/opus/volltexte/2007/816/
Go to the corresponding Portal

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

Exploiting Branch Constraints without Exhaustive Path Enumeration

pdf-format:
Document 1.pdf (280 KB)

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.

BibTeX - Entry

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

Keywords: WCET, infeasible path, branch constraints
Seminar: 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 Published by LZI