Static timing analysis for hard real-time systems

  • Authors:

  • Reinhard Wilhelm;Sebastian Altmeyer;Claire Burguière;Daniel Grund;Jörg Herter;Jan Reineke;Björn Wachter;Stephan Wilhelm

  • Affiliations:

  • Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany

  • Venue:
  • VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hard real-time systems have to satisfy strict timing constraints. To prove that these constraints are met, timing analyses aim to derive safe upper bounds on tasks’ execution times. Processor components such as caches, out-of-order pipelines, and speculation cause a large variation of the execution time of instructions, which may induce a large variability of a task’s execution time. The architectural platform also determines the precision and the complexity of timing analysis. This paper provides an overview of our timing-analysis technique and in particular the methodological aspects of interest to the verification community.