Chapter

Program Analysis and Compilation, Theory and Practice

Volume 4444 of the series Lecture Notes in Computer Science pp 12-52

New Developments in WCET Analysis

  • Christian FerdinandAffiliated withAbsInt Angewandte Informatik GmbH, Science Park 1, D-66123 Saarbrücken
  • , Florian MartinAffiliated withAbsInt Angewandte Informatik GmbH, Science Park 1, D-66123 Saarbrücken
  • , Christoph CullmannAffiliated withAbsInt Angewandte Informatik GmbH, Science Park 1, D-66123 Saarbrücken
  • , Marc SchlicklingAffiliated withAbsInt Angewandte Informatik GmbH, Science Park 1, D-66123 SaarbrückenUniversität des Saarlandes, Postfach 15 11 50, D-66041 Saarbrücken
  • , Ingmar SteinAffiliated withAbsInt Angewandte Informatik GmbH, Science Park 1, D-66123 Saarbrücken
  • , Stephan ThesingAffiliated withUniversität des Saarlandes, Postfach 15 11 50, D-66041 Saarbrücken
  • , Reinhold HeckmannAffiliated withAbsInt Angewandte Informatik GmbH, Science Park 1, D-66123 Saarbrücken

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The worst-case execution time analyzer aiT originally developed by Saarland University and AbsInt GmbH computes safe and precise upper bounds for the WCETs of tasks. It relies on a pipeline model that usually has been handcrafted. We present some new approaches aiming at automatically obtaining a pipeline model as required by aiT from a formal processor description in VHDL or Verilog. The derivation of the total WCET from the basic-block WCETs requires knowledge about upper bounds on the number of loop iterations. We present a new method for loop bound detection using dataflow analysis to derive loop invariants. A task may contain infeasible paths caused by conditionals with logically related conditions. We present a static analysis that identifies and collects conditions from the executable, and relates these collections to detect infeasible paths. This new analysis uses the results of a novel generic slicer on the level of binary code.