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

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

D. Kebbal and P. Sainrat

WORKSHOP ON WORST-CASE EXECUTION TIME (WCET) ANALYSIS 2006 (WCET 06)
Dresden, Germany, July 4, 2006

Abstract

This 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.

START Conference Manager (V2.50.1)

Maintainer: igor@gandalf.sssup.it