The IFAD VDM-SL toolbox: a practical approach to formal specifications
ACM SIGPLAN Notices
Modelling systems: practical tools and techniques in software development
Modelling systems: practical tools and techniques in software development
Termination of Nested and Mutually Recursive Algorithms
Journal of Automated Reasoning
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Another Look at Nested Recursion
TPHOLs '00 Proceedings of the 13th 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
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Validated Designs For Object-oriented Systems
Validated Designs For Object-oriented Systems
VDMTools: advances in support for formal modeling in VDM
ACM SIGPLAN Notices
The overture initiative integrating tools for VDM
ACM SIGSOFT Software Engineering Notes
Proving consistency of VDM models using HOL
Proceedings of the 2010 ACM Symposium on Applied Computing
A Deterministic Interpreter Simulating A Distributed real time system using VDM
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
| Hi-index | 0.00 |
A proof obligation is a theorem stating that a certain property must hold in order for a formal specification to be internally consistent. If a proof obligation can be proved, then the referred part in the specification is consistent. The generation of proof obligations to check for a specification's internal consistency is a concept that has been applicable in a VDM context for a long time. This work is extending the existing proof obligation generation capabilities with proof obligations for the termination of recursive functions. Those proof obligations can then automatically be moved over to HOL and the corresponding proofs can be carried out in that framework. Depending upon the nature of the recursion, the discharge of these proofs can be done automatically. This paper will categorise the different kinds of recursion.