Combining Symbolic Execution and Path Enumeration in Worst-Case Execution Time Analysis

Authors Djemai Kebbal, Pascal Sainrat



PDF
Thumbnail PDF

File

OASIcs.WCET.2006.675.pdf
  • Filesize: 143 kB
  • 6 pages

Document Identifiers

Author Details

Djemai Kebbal
Pascal Sainrat

Cite AsGet BibTex

Djemai Kebbal and Pascal Sainrat. Combining Symbolic Execution and Path Enumeration in Worst-Case Execution Time Analysis. In 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06). Open Access Series in Informatics (OASIcs), Volume 4, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/OASIcs.WCET.2006.675

Abstract

his paper examines the problem of determining bounds on execution time of real-time programs. Execution time estimation is generally useful in real-time software verification phase, but may be used in other phases of the design and execution of real-time programs (scheduling, automatic parallelizing, etc.). This paper is devoted to the worst-case execution time (WCET) analysis. We present a static WCET analysis approach aimed to automatically extract flow information used in WCET estimate computing. The approach combines symbolic execution and path enumeration. The main idea is to avoid unfolding loops performed by symbolic execution-based approaches while providing tight and safe WCET estimate.
Keywords
  • Static WCET analysis
  • flow analysis
  • symbolic execution
  • path enumeration
  • loop analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail