5055 search results - page 89 / 1011 » Relative Timing |
111
Voted
JOLLI
2002
15 years 2 months ago
2002
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
131
Voted
SP
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper studies and evaluates the extent to which automated compiler techniques can defend against timing-based side-channel attacks on modern x86 processors. We study how mo...
234
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
114
Voted
AIPS
2006
15 years 4 months ago
2006
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
107
click to vote
SBACPAD
2004
IEEE
15 years 4 months ago
2004
IEEE
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...