Termination of Isabelle functions via termination of rewriting

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Krauss, A., Sternagel, C., Thiemann, R., Fuhs, C., & Giesl, J. (2011). Termination of Isabelle functions via termination of rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6898 LNCS, pp. 152–167). https://doi.org/10.1007/978-3-642-22863-6_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free