Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

WCET
2007

favoriteEmaildiscussreport

101views Software Engineering» more WCET 2007»

Analysis of path exclusion at the machine code level

14 years 3 hour ago

Analysis of path exclusion at the machine code level

Download www.irit.fr

We present a method to ﬁnd static path exclusions in a control ﬂow graph in order to reﬁne 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.

Ingmar Stein, Florian Martin

Real-time Traffic

Control ﬂow Graph | Longest Path Analysis | Static Path Exclusions | WCET 2007 | WCET 2008 |

claim paper

Related Content

» Path key establishment using multiple secured paths in wireless sensor networks

» Determinacy Analysis for Logic Programs Using Mode and Type Information

» Path Analysis and Renaming for Predicated Instruction Scheduling

» Supporting the specification and analysis of timing constraints

» Binary analysis for measurement and attribution of program performance

» Speculative Alias Analysis for Executable Code

» Design for testability using registertransfer level partial scan selection

» Improving Generalization Level in UML Models Iterative Cross Generalization in Practice

» The Cryptographic Abstract Machine

Post Info
More Details (n/a)

Added	07 Nov 2010
Updated	07 Nov 2010
Type	Conference
Year	2007
Where	WCET
Authors	Ingmar Stein, Florian Martin

Comments (0)