Sciweavers

57 search results - page 11 / 12
» The fault span of crash failures
Sort
View
OOPSLA
2010
Springer
13 years 4 months ago
Instrumentation and sampling strategies for cooperative concurrency bug isolation
Fixing concurrency bugs (or crugs) is critical in modern software systems. Static analyses to find crugs such as data races and atomicity violations scale poorly, while dynamic a...
Guoliang Jin, Aditya V. Thakur, Ben Liblit, Shan L...
MOBICOM
2004
ACM
13 years 11 months ago
FLSS: a fault-tolerant topology control algorithm for wireless networks
Topology control algorithms usually reduce the number of links in a wireless network, which in turn decreases the degree of connectivity. The resulting network topology is more su...
Ning Li, Jennifer C. Hou
SAC
2010
ACM
14 years 1 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
GAMESEC
2011
344views Game Theory» more  GAMESEC 2011»
12 years 5 months ago
Aegis A Novel Cyber-Insurance Model
Recent works on Internet risk management have proposed the idea of cyber-insurance to eliminate risks due to security threats, which cannot be tackled through traditional means suc...
Ranjan Pal, Leana Golubchik, Konstantinos Psounis
MOBICOM
1997
ACM
13 years 10 months ago
Reliable Broadcast in Mobile Multihop Packet Networks
We describe a reliable broadcast protocol for mobile multihop packet radio networks. The reliable broadcast service ensures that all the hosts in a group deliver the same set of m...
Elena Pagani, Gian Paolo Rossi