Induction for Termination

Isabelle Gnaedig 1 Hélène Kirchner 1 Thomas Genet
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 new approach to prove termination of innermost rewriting, based on induction, abstraction and narrowing. The induction ordering is not explicitly given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints. A rule-based description of the technique is given, as well as a few examples to illustrate the method.
Type de document :
[Intern report] 99-R-338 || gnaedig99a, 1999, 21 p
Liste complète des métadonnées
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:40:35
Dernière modification le : mardi 24 avril 2018 - 14:12:05


  • HAL Id : inria-00098943, version 1



Isabelle Gnaedig, Hélène Kirchner, Thomas Genet. Induction for Termination. [Intern report] 99-R-338 || gnaedig99a, 1999, 21 p. 〈inria-00098943〉



Consultations de la notice