Certification of Termination Proofs Using Polynomial Interpretations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Certification of Termination Proofs Using Polynomial Interpretations

Résumé

The aim of the work described in this paper is to formalize in the proof assistant \coq the polynomial interpretation termination criterion, and to describe how a termination proof for a given rewriting system can be built automatically by using this formalization together with a polynomial interpretation provided by the CiME tool. The main results of this work are a formalization of first-order term algebras (with arities), a formalization of polynomials with several indeterminates, and a formalized proof of the polynomial interpretation termination criterion.
Fichier non déposé

Dates et versions

inria-00001205 , version 1 (05-04-2006)

Identifiants

  • HAL Id : inria-00001205 , version 1

Citer

Sébastien Hinderer. Certification of Termination Proofs Using Polynomial Interpretations. 17th European Summer School in Logic, Language and Information - ESSLLI '05, Aug 2005, Edimbourg/Grande Bretagne. ⟨inria-00001205⟩
98 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More