Computing worst case execution time (WCET) by Symbolically Executing a time-accurate Hardware Model
Bilel Benhamamouch, Bruno Monsuez
Abstract
Bilel Benhamamouch, Bruno Monsuez
Abstract
Abstract—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 paper, 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 there exists an executable timed model of the hardware, we first use symbolic execution [1] to precisely infer the execution time for a given instruction flow. Then we merge the states relying on the loss of precision we are ready to accept.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract—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 paper, 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 there exists an executable timed model of the hardware, we first use symbolic execution [1] to precisely infer the execution time for a given instruction flow. Then we merge the states relying on the loss of precision we are ready to accept.
Key concepts: Computer science, Executable, Worst-case execution time, Execution time, Parameterized complexity, Symbolic execution, Merge (version control), Correctness