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.
Type de document :
Communication dans un congrès
4th International Workshop on Rewriting Logic and its Applications - WRLA' 02, 2002, Pisa, Italy, 16 p, 2002
Liste complète des métadonnées

https://hal.inria.fr/inria-00100755
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:50:17
Dernière modification le : jeudi 11 janvier 2018 - 06:19:57

Identifiants

  • 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, 2002. 〈inria-00100755〉

Partager

Métriques

Consultations de la notice

92