Abstract | ||
---|---|---|
By means of an example, we present a formal method based on CSP to design fault tolerant systems. This method combines algebraic and assertional techniques to achieve complete formal verification of the fault tolerant system's correctness properties. Verification steps are executed in parallel with top-down design, so that correctness proofs can be clearly structured and their completeness easily checked. In this way formal verification is applicable not only to small examples but to reasonably large systems. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1007/BF02259751 | Distributed computing |
Keywords | Field | DocType |
Fault tolerant systems,Formal specification,Formal verification,Invent and verify paradigm,Top-down design,CSP | Functional verification,Programming language,Computer science,Correctness,Petroleum engineering,Systems design,Formal specification,Runtime verification,Fault tolerance,Formal methods,Formal verification,Distributed computing | Journal |
Volume | Issue | ISSN |
5 | 2 | 0178-2770 |
Citations | PageRank | References |
18 | 1.17 | 8 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jan Peleska | 1 | 532 | 48.74 |