Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Bulwahn, L., Krauss, A., & Nipkow, T. (2007). Finding lexicographic orders for termination proofs in Isabelle/HOL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4732 LNCS, pp. 38–53). Springer Verlag. https://doi.org/10.1007/978-3-540-74591-4_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
