scispace - formally typeset
Open AccessJournal ArticleDOI

The worst-case execution-time problem—overview of methods and survey of tools

TLDR
Different approaches to the determination of upper bounds on execution times are described and several commercially available tools1 and research prototypes are surveyed.
Abstract
The determination of upper bounds on execution times, commonly called worst-case execution times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying processor architecture has components, such as caches, pipelines, branch prediction, and other speculative components. This article describes different approaches to this problem and surveys several commercially available tools1 and research prototypes.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A survey of hard real-time scheduling for multiprocessor systems

TL;DR: The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed, and provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes.
Journal ArticleDOI

The past, present and future of cyber-physical systems: a focus on models.

TL;DR: Two projects show that deterministic CPS models with faithful physical realizations are possible and practical and shows that the timing precision of synchronous digital logic can be practically made available at the software level of abstraction.
Journal ArticleDOI

Performance evaluation of component-based software systems: A survey

TL;DR: A comprehensive state-of-the-art survey of more than 20 performance prediction and measurement approaches for component-based software systems, classified according to the expressiveness of their component performance modelling languages.
Journal ArticleDOI

Ascertaining Uncertainty for Efficient Exact Cache Analysis

TL;DR: In this paper, a novel abstract interpretation is proposed to determine whether a particular instruction may cause a hit and a miss on different paths, and an exact analysis is used to remove all remaining uncertainty, based on model checking.
Proceedings ArticleDOI

SPEED: precise and efficient static estimation of program computational complexity

TL;DR: An inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined quantitative functions of input data-structures and an algorithm for automating this proof methodology is introduced.
References
More filters

Model checking

TL;DR: Model checking tools, created by both academic and industrial teams, have resulted in an entirely novel approach to verification and test case generation that often enables engineers in the electronics industry to design complex systems with considerable assurance regarding the correctness of their initial designs.
Proceedings ArticleDOI

Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

TL;DR: In this paper, the abstract interpretation of programs is used to describe computations in another universe of abstract objects, so that the results of abstract execution give some information on the actual computations.
Book

Principles of program analysis

TL;DR: This book is unique in providing an overview of the four major approaches to program analysis: data flow analysis, constraint-based analysis, abstract interpretation, and type and effect systems.
Journal ArticleDOI

SimpleScalar: an infrastructure for computer system modeling

TL;DR: The SimpleScalar tool set provides an infrastructure for simulation and architectural modeling that can model a variety of platforms ranging from simple unpipelined processors to detailed dynamically scheduled microarchitectures with multiple-level memory hierarchies.
Related Papers (5)