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
3 Citations
A theory for execution-time derivation in real-time programs
  • 7
  • PDF
Programs as Paths: An Approach to Timing Constraint Analysis
  • 4
Procedures and parameters in the real-time program refinement calculus
  • I. Hayes
  • Computer Science
  • Sci. Comput. Program.
  • 2007
  • 1

References

SHOWING 1-10 OF 42 REFERENCES
A theory for execution-time derivation in real-time programs
  • 7
  • PDF
A sequential real-time refinement calculus
  • 53
  • PDF
On the false path problem in hard real-time programs
  • P. Altenbernd
  • Computer Science
  • Proceedings of the Eighth Euromicro Workshop on Real-Time Systems
  • 1996
  • 108
Predicting program execution times by analyzing static and dynamic program paths
  • C. Park
  • Computer Science
  • Real-Time Systems
  • 2005
  • 150
  • PDF
An Accurate Worst Case Timing Analysis for RISC Processors
  • 318
Computing Maximum Task Execution Times — A Graph-Based Approach
  • 242
Combining static worst-case timing analysis and program proof
  • 38
Experiments with a program timing tool based on source-level timing schema
  • C. Park, A. Shaw
  • Computer Science
  • [1990] Proceedings 11th Real-Time Systems Symposium
  • 1990
  • 124
...
1
2
3
4
5
...