Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Termination of Isabelle Functions via Termination of Rewriting
 

Summary: Termination of Isabelle Functions via
Termination of Rewriting
Alexander Krauss,1
Christian Sternagel,2
Ren´e Thiemann,2
Carsten Fuhs,3
and
J¨urgen Giesl3
1
Institut f¨ur Informatik, Technische Universit¨at M¨unchen, Germany
2
Institute of Computer Science, University of Innsbruck, Austria
3
LuFG Informatik 2, RWTH Aachen University, Germany
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

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences