2000 character limit reached
Timed Automata for Modelling Caches and Pipelines (1511.04172v1)
Published 13 Nov 2015 in cs.FL and cs.LO
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.