The formal semantics of ISO VDM-SL
Computer Standards & Interfaces - Special issue on formal description techniques
Translating Specifications in VDM-SL to PVS
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
An Isabelle-Based Theorem Prover for VDM-SL
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
A Proof Obligation Generator for VDM-SL
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
On Type Checking in VDM and Related Consistency Issues
VDM '91 Proceedings of the 4th International Symposium of VDM Europe on Formal Software Development-Volume I: Conference Contributions - Volume I
An Approach to the Static Semantics of VDM-SL
VDM '91 Proceedings of the 4th International Symposium of VDM Europe on Formal Software Development-Volume I: Conference Contributions - Volume I
On the verification of VDM specification and refinement with PVS
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
Validated Designs For Object-oriented Systems
Validated Designs For Object-oriented Systems
VDMTools: advances in support for formal modeling in VDM
ACM SIGPLAN Notices
Recent industrial applications of VDM in Japan
FACS-FMI'07 Proceedings of the 2007th internatioanal conference on Formal Methods in Industry
Proof obligation generation and discharging for recursive definitions in VDM
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Hi-index | 0.00 |
Although consistency of formal models is crucial, consistency proofs should not be a large burden to the user. Hence, it is important to have access to efficient proof support which is able to automate a large part of the consistency proofs. We have developed a tool that automatically translates a large subset of VDM and its associated proof obligations, which ensure model consistency, to the theorem prover HOL. In addition, powerful tactics have been constructed to discard most of the proof obligations automatically. The application of our approach to four case studies shows that a high degree of automation can be achieved.