Skip to Main content Skip to Navigation
Journal articles

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. The induction ordering is not needed a priori, but is a solution of constraints set along the proof. Our method applies in particular to systems that are non-terminating for the standard strategy nor even for the lazy strategy.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00099654
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:39:49 AM
Last modification on : Friday, April 12, 2019 - 10:20:07 AM

Identifiers

  • HAL Id : inria-00099654, version 1

Collections

Citation

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination. Electronic Notes in Theoretical Computer Science, Elsevier, 2003, 71, 20 p. ⟨inria-00099654⟩

Share

Metrics

Record views

177