2006Unpublished venueRequires access

Symbolic WCET Analysis of Programs Containing Input-Dependent Branches

Ji Meng

Open publisher page 0 citations

Abstract

Symbolic WCET (worst-case execution time) analysis yields symbolic upper bound expressions for tasks that contain parameters. Quickly evaluated at run-time, such expressions can improve the accuracy of WCET estimate. This paper proposes a symbolic WCET analysis method that is especially for the input-data dependent branches. First, the formulas described by Blieberger is expanded, so that they can express the input-data dependent branches. Simplification of the formulas using control-dependent graph yields conditional symbolic expressions that have different forms corresponding to different input value ranges. Different from the existing methods, the symbolic formulas are directly dependent on input-data, so WCET estimate evaluation at run-time is more simple and straightforward.

About this research paper

What this paper is about

Symbolic WCET (worst-case execution time) analysis yields symbolic upper bound expressions for tasks that contain parameters. Quickly evaluated at run-time, such expressions can improve the accuracy of WCET estimate. This paper proposes a symbolic WCET analysis method that is especially for the input-data dependent branches. First, the formulas described by Blieberger is expanded, so that they can express the input-data dependent branches. Simplification of the formulas using control-dependent graph yields conditional symbolic expressions that have different forms corresponding to different input value ranges. Different from the existing methods, the symbolic formulas are directly dependent on input-data, so WCET estimate evaluation at run-time is more simple and straightforward.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Symbolic WCET (worst-case execution time) analysis yields symbolic upper bound expressions for tasks that contain parameters. Quickly evaluated at run-time, such expressions can improve the accuracy of WCET estimate. This paper proposes a symbolic WCET analysis method that is especially for the input-data dependent branches. First, the formulas described by Blieberger is expanded, so that they can express the input-data dependent branches. Simplification of the formulas using control-dependent graph yields conditional symbolic expressions that have different forms corresponding to different input value ranges. Different from the existing methods, the symbolic formulas are directly dependent on input-data, so WCET estimate evaluation at run-time is more simple and straightforward.

Key concepts: Computer science, Symbolic data analysis, Symbolic execution, Simple (philosophy), Graph, Worst-case execution time, Algorithm, Execution time

Related papers

Back to paper searchBrowse research topicsOriginal source
Symbolic WCET Analysis of Programs Containing Input-Dependent Branches — Research Paper | ScholarLens