Skip to Main content Skip to Navigation
New interface

Induction for termination with local strategies - Extended version -

Olivier Fissore 1 Isabelle Gnaedig 1 Hélène Kirchner 1 
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we propose a method for specifically proving termination of rewriting with particular strategies: local strategies on operators. An inductive proof procedure is proposed, based on an explicit induction on the termination property. Given a term, the proof principle relies on alternatively applying the induction hypothesis on its subterms, by abstracting the subterms with induction variables, and narrowing the obtained terms in one step, according to the strategy. The induction relation, an F-stable ordering having the subterm property, is not given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints.
Document type :
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, October 19, 2006 - 9:00:40 AM
Last modification on : Thursday, October 27, 2022 - 1:45:02 PM
Long-term archiving on: : Friday, November 25, 2016 - 1:07:26 PM


  • HAL Id : inria-00107541, version 1


Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Induction for termination with local strategies - Extended version -. [Intern report] A01-R-177 || fissore01b, 2001, 29 p. ⟨inria-00107541⟩



Record views


Files downloads