Beauty is our business
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
A Discipline of Programming
Using a PVS Embedding of CSP to Verify Authentication Protocols
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Formalisation of B in Isabelle/HOL
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
| Hi-index | 0.00 |
Consistency checking in the CSP @? B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outside its precondition. Previously this was done by preprocessing the CSP process to perform a weakest precondition semantics proof. An embedding of the CSP traces model already exists in the PVS theorem prover, which makes use of 'uniform properties' to define valid traces. By including a state model we can extend the notion of uniform properties to define consistency. In this paper we give a framework which uses these semantic embeddings to eliminate the need for preprocessing. CSP @? B supports compositional verification, and the added benefit of this framework is that rely/guarantee style decomposition emerges naturally during a proof of consistency.