English

Timed Automata for Modelling Caches and Pipelines

Formal Languages and Automata Theory 2015-11-16 v1 Logic in Computer Science

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.

Keywords

Cite

@article{arxiv.1511.04172,
  title  = {Timed Automata for Modelling Caches and Pipelines},
  author = {Franck Cassez and Pablo González de Aledo Marugán},
  journal= {arXiv preprint arXiv:1511.04172},
  year   = {2015}
}

Comments

In Proceedings MARS 2015, arXiv:1511.02528

R2 v1 2026-06-22T11:44:14.876Z