Sciweavers

242 search results - page 8 / 49
» Computing bounds for fault tolerance using formal techniques
Sort
View
SOSP
2001
ACM
15 years 6 months ago
BASE: Using Abstraction to Improve Fault Tolerance
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
Rodrigo Rodrigues, Miguel Castro, Barbara Liskov
FOCS
1993
IEEE
15 years 1 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
IPPS
1998
IEEE
15 years 1 months ago
Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the mo...
Charles Shields Jr., Vikas Jain, Simeon C. Ntafos,...
DSN
2000
IEEE
15 years 2 months ago
Testing for Software Vulnerability Using Environment Perturbation
We describe an methodology for testing a software system for possible security flaws. Based on the observation that most security flaws are caused by the program’s inappropria...
Wenliang Du, Aditya P. Mathur
DSN
2006
IEEE
15 years 3 months ago
Automatic Instruction-Level Software-Only Recovery
As chip densities and clock rates increase, processors are becoming more susceptible to transient faults that can affect program correctness. Computer architects have typically ad...
Jonathan Chang, George A. Reis, David I. August