Computing WCET using symbolic execution

Benhamamouch, Bilel; Monsuez, Bruno; Védrine, Franck

doi:10.14236/ewic/vecos2008.12

Cited by 4 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many static WCET analyzers for hard real‐time systems combine symbolic execution with timed automata and static analysis to compute WCET estimations . In the context of these techniques, symbolic execution complements (mostly static) analysis procedures, assisting the pruning of infeasible execution paths that would jeopardize the precision of the estimations.…”

Section: Related Workmentioning

confidence: 99%

“…Traditional techniques for WCET analysis of hard real‐time systems include steps based on symbolic execution to prune infeasible execution paths, but they do not generally address the generation of WCET test cases . These techniques exploit symbolic execution on restricted parts of the overall system, to tune higher lever static analysis procedures.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Facilitating program performance profiling via evolutionary symbolic execution

Aquino

Braione

Denaro

et al. 2019

Software Testing Verif & Rel

View full text Add to dashboard Cite

Summary Performance profiling can benefit from test cases that hit high‐cost executions of programs. In this paper, we investigate the problem of automatically generating test cases that trigger the worst‐case execution of programs and propose a novel technique that solves this problem with an unprecedented combination of symbolic execution and evolutionary algorithms. Our technique, which we refer to as ‘Evolutionary Symbolic Execution’, embraces the execution cost of the program paths as the fitness function to pursue the worst execution. It defines an original set of evolutionary operators, based on symbolic execution, which suitably sample the possible program paths to make the search process effective. Specifically, our technique defines a memetic algorithm that (i) incrementally evolves by steering symbolic execution to traverse new program paths that comply with execution conditions combined and refined from the currently collected worse program paths and (ii) periodically applies local optimizations to the execution conditions of the worst currently identified program path to further speed up the identification of the worst path. We report on a set of initial experiments indicating that our technique succeeds in generating good worst‐case test cases for programs with which existing approaches cannot cope. Also, we show that, as far as the problem of generating worst‐case test cases is concerned, the distinguishing evolutionary operators based on symbolic execution that we define in this paper are more effective than traditional operators that directly manipulate the program inputs.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Facilitating program performance profiling via evolutionary symbolic execution

Aquino

Braione

Denaro

et al. 2019

Software Testing Verif & Rel

View full text Add to dashboard Cite

show abstract

“…However, their goal differs from ours. For example, [4,6,8] use symbolic execution as a method to reduce the duration of the WCET analysis. In [21], the authors use symbolic states to model the effect of pipelines on the WCET.…”

Section: Related Workmentioning

confidence: 99%

Symbolic WCET Computation

Ballabriga

Forget

Lipari

2017

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…However, their goal differs from ours. For example, [6,4,8] use symbolic execution as a method to reduce the duration of the WCET analysis. In [21], the authors use symbolic states to model the effect of pipelines on the WCET.…”

Section: Related Workmentioning

confidence: 99%

Symbolic Computation of the Worst-Case Execution Time of a Program

Ballabriga,

Forget,

Lipari

2017

Preprint

View full text Add to dashboard Cite

Parametric Worst-case execution time (WCET) analysis of a sequential program produces a formula that represents the worst-case execution time of the program, where parameters of the formula are user-defined parameters of the program (as loop bounds, values of inputs or internal variables, etc).In this paper we propose a novel methodology to compute the parametric WCET of a program. Unlike other algorithms in the literature, our method is not based on Integer Linear Programming (ILP). Instead, we follow an approach based on the notion of symbolic computation of WCET formulae. After explaining our methodology and proving its correctness, we present a set of experiments to compare our method against the state of the art. We show that our approach dominates other parametric analyses, and produces results that are very close to those produced by non-parametric ILP-based approaches, while keeping very good computing time.

show abstract

Computing WCET using symbolic execution

Cited by 4 publications

References 8 publications

Facilitating program performance profiling via evolutionary symbolic execution

Facilitating program performance profiling via evolutionary symbolic execution

Symbolic WCET Computation

Symbolic Computation of the Worst-Case Execution Time of a Program

Contact Info

Product

Resources

About