Timed Automata for Modelling Caches and Pipelines
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.
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
Open Publishing Association
2015-11-01
|
| Serie: | Electronic Proceedings in Theoretical Computer Science |
| Länkar: | http://arxiv.org/pdf/1511.04172v1 |