WCET'06 Workshop Program

8:30-8:45 Welcome (Frank Mueller)
8:45-10:00 Session 1: Tightening WCET Bounds
Algorithms for Infeasible Path Calculation
  Jan Gustafsson, Andreas Ermedahl, and Björn Lisper
Comparing WCET and Resource Demands of Trigonometric Functions Implemented as Iterative Calculations vs. Table-Lookup
  Raimund Kirner, Markus Groessing, Peter Puschner
History-based Schemes and Implicit Path Enumeration
  Claire Burguière and Christine Rochange
10:00-10:30 Break
10:30-11:20 Session 2: Timing Anomalies (Chair: Isabelle Puaut)
A Definition and Classification of Timing Anomalies
  Jan Reineke, Bjoern Wachter, Stephan Thesing, Reinhard Wilhelm, Ilia Polian, Jochen Eisinger, and Bernd Becker
PLRU Cache Domino Effects
  Christoph Berg
11:20-12:30 Keynote: The sorrows of young W(CET)er, Tullio Vardanega, Univ. of Padua (Italy), formerly European Space Agency
12:30-2:00 Lunch
2:00-3:15 Session 3: Compilers and WCET (Chair: Jan Gustafsson)
Design of a WCET-Aware C Compiler
  Heiko Falk, Paul Lokuciejewski, Henrik Theiling
Loop Nest Splitting for WCET-Optimization and Predictability Improvement
  Heiko Falk, Martin Schwarzer
Combining Symbolic Execution and Path Enumeration in Worst-Case Execution Time Analysis
  D. Kebbal and P. Sainrat
3:15-3:45 Break
3:45-5:00 Session 4: Potpourri (Chair: Niklas Holsti)
A Framework for Response Times Calculation Of Multiple Correlated Events
  Simon Schliecker, Matthias Ivers, Jan Staschulat, Rolf Ernst
Towards Formally Verifiable WCET Analysis for a Functional Programming Language
  Kevin Hammond, Roy Dyckhoff, Christian Ferdinand, Reinhold Heckmann, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert Pointon, Norman Scaife, Jocelyn Serot and Andy Wallace
PapaBench: a Free Real-Time Benchmark
  F. Nemer, H. Cassé, P. Sainrat, J.P. Bahsoun
5:00-5:30 WCET Competition (Guillem Bernat, Jan Gustafsson, Reinhard v. Hanxleden, Reinhard Wilhelm)
5:30-5:35 Wrap-up (Frank Mueller)