Communicating sequential processes
Communicating sequential processes
The existence of refinement mappings
Theoretical Computer Science
Beauty is our business
The Z notation: a reference manual
The Z notation: a reference manual
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
An Approach to the Design of Distributed Systems with B AMN
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
Refinement of State-Based Concurrent Systems
VDM '90 Proceedings of the Third International Symposium of VDM Europe on VDM and Z - Formal Methods in Software Development
csp2B: A Practical Approach to Combining CSP and B
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Specifying Interactive Systems in Object-Z and CSP
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Model-Checking CSP-OZ Specifications with FDR
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Structural Refinement in Object-Z/CSP
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Using Model Checking to Automatically Find Retrieve Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper, we describe an approach to generating abstraction invariants for data refinement from specifications mixing B and CSP notations. A model-checker can be used to check automatically refinement of the CSP parts. However, we need to translate the CSP into B in order to verify data refinement of the whole specification. The Csp2B tool generates the B specification automatically from the CSP parts. Our proposal is to generate in addition the abstraction invariants, by analysing the labelled transition systems provided by a model-checker. The approach is illustrated with a case study in which a simple distributed information system is specified and two refinements are given, both of which have been fully verified using the proposed combination of model-checking with theorem proving (both automatic and interactive).