Computation of the worst case execution time : formal analysis method that fits the increasing complexity of the hardware architecture

To ensure that a program will respect all its timing constraints we must be able to compute a safe estimation of its worst case execution time (WCET). However with the increasing sophistication of the processors, computing a precise estimation of the WCET becomes very difficult. In this report, we propose a novel formal method to compute a precise estimation of the WCET that can be easily parameterized by the hardware architecture. Assuming that we developed an executable timed model of the hardware, we use symbolic execution to precisely infer the execution time for a given instruction flow. We also merge the states relying on the loss of precision we are ready to accept, in order to avoid a possible states explosion.

Data and Resources

Additional Info

Field Value
Source https://theses.hal.science/tel-00685866
Author Benhamamouch, Bilel
Maintainer CCSD
Last Updated May 22, 2026, 12:25 (UTC)
Created May 22, 2026, 12:25 (UTC)
Identifier NNT: 2011GRENM014
Language fr
Rights https://about.hal.science/hal-authorisation-v1/
contributor VERIMAG (VERIMAG - IMAG) ; Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)
creator Benhamamouch, Bilel
date 2011-05-02T00:00:00
harvest_object_id 958ddd32-b274-4184-90fe-1e067e30b93a
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-03-30T00:00:00
set_spec type:THESE