CARIBOO: An Induction Based Proof Tool for Termination with Strategies -- Extended version-- - Archive ouverte HAL Access content directly
Reports Year : 2002

CARIBOO: An Induction Based Proof Tool for Termination with Strategies -- Extended version--

(1) , (1) , (1)
1

Abstract

We describe Cariboo, the implementation of an inductive process recently proposed to prove termination of rewriting under strategies on ground term algebras. The method is based on an abstraction mechanism, introducing variables that represent ground terms in normal form, and on narrowing, schematizing reductions on ground terms. It applies in particular to non-terminating systems which are terminating with innermost or local strategies. The narrowing process, well known to easily diverge, is controlled by using appropriate abstraction constraints. The proof mechanism lies on abstraction and ordering constraints satisfiability problems. Thanks to the power of induction, ordering constraints are often simple and automatically solved by our system. Otherwise, they can be treated by the user or any external automatic solver. On many examples, Cariboo even enables to succeed without considering any constraint at all; the process is then completely automatic. Cariboo offers a graphical view of the proof process. It is implemented in ELAN, a rule based programming environment, and so can be used for proving termination of ELAN programs.
Fichier principal
Vignette du fichier
A02-R-077.pdf (336.63 Ko) Télécharger le fichier

Dates and versions

inria-00099426 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099426 , version 1

Cite

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. CARIBOO: An Induction Based Proof Tool for Termination with Strategies -- Extended version--. [Intern report] A02-R-077 || fissore02b, 2002. ⟨inria-00099426⟩
99 View
40 Download

Share

Gmail Facebook Twitter LinkedIn More