Communicating sequential processes
Communicating sequential processes
Correctness proofs of distributed termination algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Systematic software development using VDM
Systematic software development using VDM
The foundations of program verification (2nd ed.)
The foundations of program verification (2nd ed.)
Two normal form theorems for CSP programs
Information Processing Letters
Development methods for trusted computer systems
Formal Aspects of Computing
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Structured Analysis and System Specification
Structured Analysis and System Specification
Design and Verification of Distributed Recovery Blocks with CSP
Formal Methods in System Design
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Applied formal methods – from CSP to executable hybrid specifications
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
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.