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.2007.1196
URN: urn:nbn:de:0030-drops-11964
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2007/1196/
Go to the corresponding OASIcs Volume Portal

Stein, Ingmar ; Martin, Florian

Analysis of path exclusion at the machine code level

pdf-format:
stein.1196.pdf (0.3 MB)

Abstract

We present a method to find static path exclusions in a
control flow graph in order to refine the WCET analysis.
Using this information, some infeasible paths can be discarded
during the ILP-based longest path analysis which
helps to improve precision. The new analysis works at the
assembly level and uses the Omega library to evaluate Presburger
formulas.

BibTeX - Entry

@InProceedings{stein_et_al:OASIcs:2007:1196,
  author =	{Ingmar Stein and Florian Martin},
  title =	{{Analysis of path exclusion at the machine code level}},
  booktitle =	{7th International Workshop on Worst-Case Execution Time Analysis (WCET'07)},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-05-7},
  ISSN =	{2190-6807},
  year =	{2007},
  volume =	{6},
  editor =	{Christine Rochange},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1196},
  URN =		{urn:nbn:de:0030-drops-11964},
  doi =		{10.4230/OASIcs.WCET.2007.1196},
  annote =	{Keywords: Flow-constraint, control flow graph, path exclusion }
}

Keywords: Flow-constraint, control flow graph, path exclusion
Collection: 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07)
Issue Date: 2007
Date of publication: 13.11.2007

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