242 search results - page 29 / 49 » Computing bounds for fault tolerance using formal techniques |
77
Voted
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Checkpointing is an indispensable technique to provide fault tolerance for long-running high-throughput applications like those running on desktop grids. This paper argues that...
CHI
2002
ACM
15 years 10 months ago
2002
ACM
We propose a formal experimental paradigm designed to help evaluate scrolling interaction techniques. Such a method is needed by interaction designers to quantify scrolling perfor...
DSN
2004
IEEE
15 years 1 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
HIPC
2009
Springer
14 years 7 months ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
ISPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...