Sciweavers

136 search results - page 12 / 28
» A Theory for Observational Fault Tolerance
Sort
View
90
Voted
CCS
2009
ACM
15 years 10 months ago
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
Kannan Srinathan, Arpita Patra, Ashish Choudhary, ...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
15 years 10 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
FLAIRS
2006
14 years 11 months ago
Focusing Strategies for Multiple Fault Diagnosis
Diagnosing multiple faults for a complex system is often very difficult. It requires not only a model which adequately represents the diagnostic aspect of a complex system, but al...
Tsai-Ching Lu, K. Wojtek Przytula
DSN
2008
IEEE
15 years 4 months ago
Coverage of a microarchitecture-level fault check regimen in a superscalar processor
Conventional processor fault tolerance based on time/space redundancy is robust but prohibitively expensive for commodity processors. This paper explores an unconventional approac...
Vimal K. Reddy, Eric Rotenberg
105
Voted
SSS
2009
Springer
143views Control Systems» more  SSS 2009»
15 years 4 months ago
Self Adaptive High Interaction Honeypots Driven by Game Theory
High-interaction honeypots are relevant to provide rich and useful information obtained from attackers. Honeypots come in different flavors with respect to their interaction pote...
Gérard Wagener, Radu State, Alexandre Dulau...