2006Journal of SoftwareRequires access

Symbolic WCET Analysis of Programs Containing Input-Dependent Branches

Meng-Luo Ji

Open publisher page 1 citations

Abstract

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 words: parametric worst-case execution time (WCET) analysis; WCET analysis; program analysis; real-time system; software engineering

About this research paper

What this paper is about

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 words: parametric worst-case execution time (WCET) analysis; WCET analysis; program analysis; real-time system; software engineering

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

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 words: parametric worst-case execution time (WCET) analysis; WCET analysis; program analysis; real-time system; software engineering

Key concepts: Computer science, Programming language, Symbolic execution, Symbolic data analysis, Theoretical computer science, Software

Related papers

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