Blending Object-Z and Timed CSP: an introduction to TCOZ
Proceedings of the 20th international conference on Software engineering
Specification, Refinement and Verification of Concurrent Systems—An Integration of Object-Z and CSP
Formal Methods in System Design
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Specifying and analyzing security automata using CSP-OZ
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
ProB: an automated analysis toolset for the B method
International Journal on Software Tools for Technology Transfer (STTT)
Decomposition Structures for Event-B
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Applying Model Checking to Generate Model-Based Integration Tests from Choreography Models
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
Structured event-b models and proofs
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Combining CSP and b for specification and property verification
FM'05 Proceedings of the 2005 international conference on Formal Methods
Visualising larger state spaces in ProB
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Generating Hierarchical State Based Representation From Event-B Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement plans for informed formal design
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
| Hi-index | 0.00 |
In Event-B a system is developed using refinement. The language is based on a relatively small core; in particular there is only a very small number of substitutions. This results in much simpler proof obligations, that can be handled by automatic tools. However, the downside is that, in case of software development, structural information is not explicitly available but hidden in the chain of refinements. This paper discusses a method to uncover these implicit algorithmic structures and use them in a model checker. Other applications are code generation, model comprehension, and test-case generation.