Timed Automata for Modelling Caches and Pipelines
classification
💻 cs.FL
cs.LO
keywords
cachesmodellingpipelinesprogramstimedarchitecturesaspectsautomata
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.