256 search results - page 12 / 52 » Approximation of the worst-case execution time using structu... |
102
click to vote
ECRTS
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper we present co-transformation, a novel approach to the mapping of execution information from the source code of a program to the object code for the purpose of worst-...
105
Voted
WADS
2007
Springer
15 years 7 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
109
click to vote
QEST
2008
IEEE
15 years 8 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
132
click to vote
JSA
2000
15 years 1 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
107
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...