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
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Function Definition in Higher-Order Logic
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Mechanical Verification of Total Correctness through Diversion Verification Conditions
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A predicative analysis of structural recursion
Journal of Functional Programming
Defining and reasoning about recursive functions: a practical tool for the coq proof assistant
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Termination analysis with calling context graphs
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Partial recursive functions in higher-order logic
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Certified Size-Change Termination
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Proof Pearl: Mechanizing the Textbook Proof of Huffman's Algorithm
Journal of Automated Reasoning
Partial and Nested Recursive Function Definitions in Higher-order Logic
Journal of Automated Reasoning
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Towards a verification framework for faulty message passing systems in PVS
Innovations in Systems and Software Engineering
Termination of Isabelle functions via termination of rewriting
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Nitpick: a counterexample generator for higher-order logic based on a relational model finder
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method turns out to be powerful enough to solve a large majority of termination problems encountered in daily theorem proving practice.