Skip to Main content Skip to Navigation

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 : From an inductive method for proving weak innermost termination of rule-based programs, we automatically infer, for each successful proof, a finite strategy for data evaluation. The proof principle uses an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we analyse proof trees built from the rewrite system, schematizing the innermost derivations of any ground term. These proof trees are issued from patterns representing sets of ground terms. They are generated using two mechanisms, namely abstraction, introducing variables that represent ground terms in normal form, and narrowing, schematizing rewriting on ground terms. From the proof trees, we can extract for any given ground term, a rewriting strategy to compute one of its normal form, even if the ground term admits infinite rewriting derivations.
Document type :
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, October 19, 2006 - 9:07:38 AM
Last modification on : Thursday, January 20, 2022 - 4:12:13 PM
Long-term archiving on: : Friday, November 25, 2016 - 12:38:25 PM


  • HAL Id : inria-00107744, version 1



Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Proving weak termination also provides the right way to terminate - extended version -. [Intern report] A03-R-361 || fissore03c, 2003, 34 p. ⟨inria-00107744⟩



Les métriques sont temporairement indisponibles