Skip to Main content Skip to Navigation

Induction for Termination

Isabelle Gnaedig 1 Hélène Kirchner 1 Thomas Genet
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose a new approach to prove termination of innermost rewriting, based on induction, abstraction and narrowing. The induction ordering is not explicitly given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints. A rule-based description of the technique is given, as well as a few examples to illustrate the method.
Complete list of metadatas
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:40:35 AM
Last modification on : Tuesday, April 24, 2018 - 2:12:05 PM


  • HAL Id : inria-00098943, version 1



Isabelle Gnaedig, Hélène Kirchner, Thomas Genet. Induction for Termination. [Intern report] 99-R-338 || gnaedig99a, 1999, 21 p. ⟨inria-00098943⟩



Record views