A new paradigm for cache related WCET computation

In real-time systems and safety critical applications, it is a necessity to compute Worst Case Execution Time (WCET). For systems using caches, especially multi-tasking, this is hard to achieve when tight bounds are wanted for a better schedulability. A new method to stat-ically compute this kind of results, using a Markov chain model, is introduced here. It uses symbolic execution of tasks, and as such relies on abstract interpretation. Its aim is to be especially efficient in ever looping multitasking systems like hard real-time, and I&C systems