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.
|Number of pages||9|
|Journal||Electronic Proceedings in Theoretical Computer Science, EPTCS|
|Publication status||Published - 8 Nov 2015|
|Event||Workshop on Models for Formal Analysis of Real Systems (1ST : 2015) - Suva, Fiji|
Duration: 23 Nov 2015 → 23 Nov 2015