1453 search results - page 234 / 291 » State and history in operating systems |
115
Voted
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
100
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
121
Voted
CAV
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
125
click to vote
OPODIS
2003
15 years 1 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
106
click to vote
JFP
2010
14 years 11 months ago
2010
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...