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 tehcniques.
| Original language | English |
|---|---|
| Pages (from-to) | 37-45 |
| Number of pages | 9 |
| Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 196 |
| DOIs | |
| Publication status | Published - 8 Nov 2015 |
| Event | 1st Workshop on Models for Formal Analysis of Real Systems, MARS 2015 - Suva, Fiji Duration: 23 Nov 2015 → 23 Nov 2015 |
Fingerprint
Dive into the research topics of 'Timed automata for modelling caches and pipelines'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver