Termination of Isabelle functions via termination of rewriting

Authors:
Alexander Krauss;Christian Sternagel;René Thiemann;Carsten Fuhs;Jürgen Giesl
Affiliations:
Institut für Informatik, Technische Universität München, Germany;Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany
Venue:
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Year:
2011

Citing 14
Cited 1

Term rewriting and all that

Term rewriting and all that
From LCF to HOL: a short history

Proof, language, and interaction
Logic Programs as term Rewriting Systems

ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Certified Size-Change Termination

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Certification of Automated Termination Proofs

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Certification of Termination Proofs Using CeTA

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Partial and Nested Recursive Function Definitions in Higher-order Logic

Journal of Automated Reasoning
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Finding lexicographic orders for termination proofs in Isabelle/HOL

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
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
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Termination Of Term Rewriting By Semantic Labelling

Fundamenta Informaticae

Formalizing bounded increase

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

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.