Sciweavers

WCET
2010

A Code Policy Guaranteeing Fully Automated Path Analysis

13 years 2 months ago
A Code Policy Guaranteeing Fully Automated Path Analysis
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzing subtle, context dependent loop bounds manually. In this paper, we propose to restrict written and generated code to the class of programs with input-data independent loop counters. The proposed policy builds on the ideas of single-path code, but only requires partial input-data independence. It is always possible to find precise loop bounds for these programs, using an efficient variant act execution. The systematic construction of tasks following the policy is facilitated by embedding knowledge on input-data dependence in function interfaces and types. Several algorithms and benchmarks are analyzed to show that this restriction is indeed a good candidate for removing the need for manual annotations. Digital Object Identifier 10.4230/OASIcs.WCET.2010.77
Benedikt Huber, Peter P. Puschner
Added 15 Feb 2011
Updated 15 Feb 2011
Type Journal
Year 2010
Where WCET
Authors Benedikt Huber, Peter P. Puschner
Comments (0)