The Z notation: a reference manual
The Z notation: a reference manual
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
More Powerful Z Data Refinement: Pushing the State of the Art in Industrial Refinement
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
Verified Software: A Grand Challenge
Computer
The verified software repository: a step towards the verifying compiler
Formal Aspects of Computing
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
The mondex challenge: machine checked proofs for an electronic purse
FM'06 Proceedings of the 14th international conference on Formal Methods
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
Verification of Mondex Electronic Purses with KIV: From a Security Protocol to Verified Code
FM '08 Proceedings of the 15th international symposium on Formal Methods
Verifying the CICS File Control API with Z/Eves: An experiment in the verified software repository
Science of Computer Programming
Mechanising a formal model of flash memory
Science of Computer Programming
POSIX file store in Z/Eves: An experiment in the verified software repository
Science of Computer Programming
Proving theorems about JML classes
Formal methods and hybrid real-time systems
JCML: A specification language for the runtime verification of Java Card programs
Science of Computer Programming
A systematic verification approach for mondex electronic purses using ASMs
Rigorous Methods for Software Construction and Analysis
Ten commandments ten years on: lessons for ASM, B, Z and VSR-net
Rigorous Methods for Software Construction and Analysis
Hi-index | 0.00 |
We describe our experiences in mechanising the specification, refinement, and proof of the Mondex Electronic Purse using the Z/Eves theorem prover. We took a conservative approach and mechanised the original ${\sc L^{A}T_{E}X}$ sources, without changing their technical content, except to correct errors: we found problems in the original texts and missing invariants in the refinements. Based on these experiences, we present novel and detailed guidance on how to drive Z/Eves successfully. The work contributes to the research objectives of building the Repository for the Verified Software Grand Challenge.