Timed Games for Computing Worst-Case Execution-Times

Details Timed Games for Computing Worst-Case Execution-Times Timed Games for Computing Worst-Case Execution-Times

2010-06-10

arxiv.org/abs/1006.1951v1

Computer Science

Software Engineering

NICTA Research Report, Sydney, Australia

Scientific paper

In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution. %

Affiliated with

Also associated with

No associations

Rating

Timed Games for Computing Worst-Case Execution-Times does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Timed Games for Computing Worst-Case Execution-Times, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Timed Games for Computing Worst-Case Execution-Times will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-490575