Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Automated consistency checking of requirements specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Formal Methods Technology Transfer: A View from NASA
Formal Methods in System Design - Special issue: industrial critical systems
| Hi-index | 0.00 |
Consistent distribution of single-source data to replicated computing channels is a fundamental problem in fault-tolerant system design. The "Oral Messages" (OM) algorithm solves this problem in Interactive Consistency (Byzantine Agreement) assuming that all faults are worst-case. Thambidurai and Park introduced a "hybrid" fault model that distinguished three fault modes: asymetric (Byzantine), symmetric, and benign; thay also exhibited, along with an informal "proof of correctness," a modified version of OM. Unfortunately, their algorithm is flawed. The discipline of mechanically checked formal verification eventually enabled us to develop a correct algorithm for Interactive Consistency under the hybrid fault mode. This algorithm withstands $a$ asymmetric, $s$ symmetric, and $b$ benign faults simultaneously, using $m+1$ rounds, provided $n