242 search results - page 39 / 49 » Computing bounds for fault tolerance using formal techniques |
70
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
We present novel and efficient methods for on-line testing in FPGAs. The testing approach uses a ROving TEster (ROTE), which has provable diagnosabilities and is also faster than ...
100
click to vote
HPCC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
AAAI
2006
14 years 11 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
BIRTHDAY
2007
Springer
15 years 1 months ago
2007
Springer
Well understood methods exist for developing programs from formal specifications. Not only do such methods offer a precise check that certain sorts of deviations from their specifi...
EMSOFT
2006
Springer
15 years 1 months ago
2006
Springer
We present a formal approach to implement and certify fault-tolerance in real-time embedded systems. The faultintolerant initial system consists of a set of independent periodic t...