Timed Automata for Modelling Caches and Pipelines
arXiv:1511.04172 · doi:10.4204/EPTCS.196.4
Abstract
In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking techniques.
arXiv commentIn Proceedings MARS 2015, arXiv:1511.02528