Linear Approximation of Execution-Time Constraints

@article{Lermer2003LinearAO,
title={Linear Approximation of Execution-Time Constraints},
author={K. Lermer and C. Fidge and I. Hayes},
journal={Formal Aspects of Computing},
year={2003},
volume={15},
pages={319-348}
}

Abstract.This paper defines an algorithm for predicting worst-case and best-case execution times, and determining execution-time constraints of control-flow paths through real-time programs using their partial correctness semantics. The algorithm produces a linear approximation of path traversal conditions, worst-case and best-case execution times and strongest postconditions for timed paths in abstract real-time programs. Also shown are techniques for determining the set of control-flow paths… Expand