Termination of Isabelle Functions via Termination of Rewriting
We show how to automate termination proofs for recursive functions in (a first-order subset of) Isabelle/HOL by encoding them as term rewrite systems and invoking an external termination prover. Our link to the external prover includes full proof reconstruction, where all necessary properties are derived inside Isabelle/HOL without oracles. Apart from the certification of the imported proof, the main challenge is the formal reduction of the proof obligation produced by Isabelle/HOL to the termination of the corresponding term rewrite system. We automate this reduction via suitable tactics which we added to the IsaFoR library.
Unable to display preview. Download preview PDF.
- 3.Blanqui, F., Koprowski, A.: CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. Math. Struct. Comp. Science (2011) (to appear)Google Scholar
- 10.Gordon, M.: From LCF to HOL: A short history. In: Proof, Language, and Interaction, pp. 169–185. MIT Press, Cambridge (2000)Google Scholar
- 17.Sternagel, C.: Automatic Certification of Termination Proofs. PhD thesis, Institut für Informatik, Universität Innsbruck, Austria (2010)Google Scholar
- 18.Sternagel, C., Thiemann, R.: Certified subterm criterion and certified usable rules. In: Proc. RTA 2010, LIPIcs, vol. 6, pp. 325–340 (2010)Google Scholar