(Created page with " == 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...")
 
m (Scipediacontent moved page Draft Content 638028169 to Wilhelm et al 2010a)
(No difference)

Revision as of 14:16, 14 October 2020

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.\r \r This paper provides an overview of our timing-analysis technique and in particular the methodological aspects of interest to the verification community.

Document type: Part of book or chapter of book

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

Back to Top
GET EPUB

Document information

Published on 01/01/2010

Volume 2010, 2010
DOI: 10.1007/978-3-642-11319-2_3
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

Keywords

• • • • • • •

claim authorship

Are you one of the authors of this document?

I am an author