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

09/27/2017
by   Clément Ballabriga, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2022

Execution Time Program Verification With Tight Bounds

This paper presents a proof system for reasoning about execution time bo...
research
05/30/2018

BUNDLEP: Prioritizing Conflict Free Regions in Multi-Threaded Programs to Improve Cache Reuse -- Extended Results and Technical Report

In BUNDLE: Real-Time Multi-Threaded Scheduling to Reduce Cache Contentio...
research
03/15/2022

Safe Neurosymbolic Learning with Differentiable Symbolic Execution

We study the problem of learning worst-case-safe parameters for programs...
research
11/20/2017

Abstract Interpretation of Binary Code with Memory Accesses using Polyhedra

In this paper we propose a novel methodology for static analysis of bina...
research
02/26/2018

Scalable and Precise Estimation and Debugging of the Worst-Case Execution Time for Analysis-Friendly Processors

Estimating the Worst-Case Execution Time (WCET) of an application is an ...
research
04/23/2023

Exact Worst-Case Execution-Time Analysis for Implicit Model Predictive Control

We propose the first method that determines the exact worst-case executi...
research
01/12/2021

Symbolic Loop Compilation for Tightly Coupled Processor Arrays

Loop compilation for Tightly Coupled Processor Arrays (TCPAs), a class o...

Please sign up or login with your details

Forgot password? Click here to reset