Skip to Main content Skip to Navigation
New interface

Proving weak termination also provides the right way to terminate - 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 : We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of subterms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Isabelle Gnaedig Connect in order to contact the contributor
Submitted on : Friday, June 19, 2009 - 7:14:13 PM
Last modification on : Thursday, October 27, 2022 - 1:45:02 PM
Long-term archiving on: : Monday, April 5, 2010 - 11:28:48 PM


  • HAL Id : inria-00099872, version 1


Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Proving weak termination also provides the right way to terminate - Extended version -. [Intern report] A04-R-522 || fissore04b, 2004, 54 p. ⟨inria-00099872⟩



Record views


Files downloads