Termination Proofs Using gpo Ordering Constraints : Extended Version - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

Termination Proofs Using gpo Ordering Constraints : Extended Version

Abstract

We present here an algorithm for proving termination of term rewriting systems by \gpo ordering constraint solving. The algorithm gives, as automatically as possible, an appropriate instance of the gpo generic ordering proving termination of a given system. Constraint solving is done efficiently thanks to a DAG shared term data structure.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3087.pdf (483.33 Ko) Télécharger le fichier

Dates and versions

inria-00073604 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073604 , version 1

Cite

Thomas Genet, Isabelle Gnaedig. Termination Proofs Using gpo Ordering Constraints : Extended Version. [Research Report] RR-3087, INRIA. 1997, pp.37. ⟨inria-00073604⟩
104 View
107 Download

Share

Gmail Facebook Twitter LinkedIn More