Scipediacontent at 13:45, 21 January 2021

2021-01-21T13:45:44Z

Scipediacontent: Scipediacontent moved page Draft Content 638028169 to Wilhelm et al 2010a

2020-10-14T13:16:02Z

Scipediacontent moved page Draft Content 638028169 to Wilhelm et al 2010a

Scipediacontent: 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..."

2020-10-14T13:15:59Z

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..."

New page

== 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 tasks 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 ==
<pdf>Media:Draft_Content_638028169-beopen751-9177-document.pdf</pdf>

== Original document ==

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

* [http://www.cs.ox.ac.uk/people/bjoern.wachter/papers/vmcai10-invited.pdf http://www.cs.ox.ac.uk/people/bjoern.wachter/papers/vmcai10-invited.pdf]

@@ Line 2: / Line 2: @@
 == 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 tasks 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.
+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.
-−
-Document type: Part of book or chapter of book
-−
-== Full document ==
-<pdf>Media:Draft_Content_638028169-beopen751-9177-document.pdf</pdf>
@@ Line 15: / Line 10: @@
 * [http://www.cs.ox.ac.uk/people/bjoern.wachter/papers/vmcai10-invited.pdf http://www.cs.ox.ac.uk/people/bjoern.wachter/papers/vmcai10-invited.pdf]

← Older revision	Revision as of 13:16, 14 October 2020
(No difference)

Wilhelm et al 2010a - Revision history

Scipediacontent at 13:45, 21 January 2021

Scipediacontent: Scipediacontent moved page Draft Content 638028169 to Wilhelm et al 2010a

Scipediacontent: 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..."