ScholarLens Back to search
2008•Electronic workshops in computingOpen access

Computing WCET using symbolic execution

Bilel Benhamamouch, Bruno Monsuez, Franck Védrine

Open full text 13 citations

Abstract

We propose a novel formal method to compute an upper estimation of the WCET that contains the loss of precision and also can be easily parametrized by the hardware architecture. Assuming that there exists an executable timed model of the hardware, we first use symbolic execution [5] to precisely infer the execution time for a given instruction flow. We secondly identify execution states that can be merged with no loss of precision. Depending on the loss of precisionwe are ready to accept, we finally merge execution paths that have similar execution times.

Open-access reader

About this research paper

What this paper is about

We propose a novel formal method to compute an upper estimation of the WCET that contains the loss of precision and also can be easily parametrized by the hardware architecture. Assuming that there exists an executable timed model of the hardware, we first use symbolic execution [5] to precisely infer the execution time for a given instruction flow. We secondly identify execution states that can be merged with no loss of precision. Depending on the loss of precisionwe are ready to accept, we finally merge execution paths that have similar execution times.

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We propose a novel formal method to compute an upper estimation of the WCET that contains the loss of precision and also can be easily parametrized by the hardware architecture. Assuming that there exists an executable timed model of the hardware, we first use symbolic execution [5] to precisely infer the execution time for a given instruction flow. We secondly identify execution states that can be merged with no loss of precision. Depending on the loss of precisionwe are ready to accept, we finally merge execution paths that have similar execution times.

Key concepts: Computer science, Executable, Symbolic execution, Execution time, Merge (version control), Worst-case execution time, Parallel computing, Execution model

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Computing WCET using symbolic execution — Research Paper | ScholarLens