A Mechanical Proof of the Unsolvability of the Halting Problem
Journal of the ACM (JACM)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
On proving the termination of algorithms by machine
Artificial Intelligence
The Java Language Specification
The Java Language Specification
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
The KIV-Approach to Software Verification
KORSO - Methods, Languages, and Tools for the Construction of Correct Software
Deduction in the Verification Support Environment (VSE)
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Context Dependent Procedures and Computed Types in √eriFun
Electronic Notes in Theoretical Computer Science (ENTCS)
Improvements in Formula Generalization
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Second-order programs with preconditions
Verification, induction termination analysis
Second-order programs with preconditions
Verification, induction termination analysis
Reasoning about incompletely defined programs
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automated termination analysis for programs with second-order recursion
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automated synthesis of induction axioms for programs with second-order recursion
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
European collaboration on automated reasoning
AI Communications - ECAI 2012 Turing and Anniversary Track
| Hi-index | 0.00 |
We report on a university course on computer-aided program verification using the ✓eriFun system. Requirements for a system to be used in a verification course are discussed, and a sketch of our system is given. We illustrate the problems presented to the students, starting with simple sorting algorithms and finally verifying the unsolvability of the halting problem, the correctness of RSA encryption, and a first-order matching algorithm. We give an account of our experience with the course and the conclusions to be drawn from this event. We also report on further experience obtained when the system was used in an undergraduate course.