Sciweavers

19 search results - page 4 / 4
» How Fail-Stop are Faulty Programs
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Combining fault injection and model checking to verify fault tolerance in multi-agent systems
The ability to guarantee that a system will continue to operate correctly under degraded conditions is key to the success of adopting multi-agent systems (MAS) as a paradigm for d...
Jonathan Ezekiel, Alessio Lomuscio
CORR
2006
Springer
85views Education» more  CORR 2006»
13 years 7 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
SOSP
2007
ACM
14 years 4 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
SASN
2006
ACM
14 years 1 months ago
Autonomous and distributed node recovery in wireless sensor networks
Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faul...
Mario Strasser, Harald Vogt