Computing WCET using symbolic execution

Authors:
Bilel Benhamamouch;Bruno Monsuez;Franck Védrine
Affiliations:
UEI, ENSTA, Paris, France;UEI, ENSTA, Paris, France;CEA, LIST, Gif-sur-Yvette, France
Venue:
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2008

Citing 3
Cited 0

Symbolic execution and program testing

Communications of the ACM
Using symbolic execution for verifying safety-critical systems

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
The application of program verification techniques to hardware verification

DAC '79 Proceedings of the 16th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

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.