Skip to Main content Skip to Navigation
Conference papers

Outermost ground termination

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 propose a semi-automatic inductive process to prove termination of outermost rewriting on ground term algebras. The method is based on an abstraction mechanism, schematizing normalisation of subterms, and on narrowing, schematizing reductions on ground terms. Our method applies in particular to non-terminating systems which are terminating with an outermost 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 :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00100755
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:50:17 PM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM

Identifiers

  • HAL Id : inria-00100755, version 1

Collections

Citation

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination. 4th International Workshop on Rewriting Logic and its Applications - WRLA' 02, 2002, Pisa, Italy, 16 p. ⟨inria-00100755⟩

Share

Metrics

Record views

190