A Proof of Weak Termination Providing the Right Way to Terminate

@inproceedings{Fissore2004APO,
  title={A Proof of Weak Termination Providing the Right Way to Terminate},
  author={Olivier Fissore and Isabelle Gnaedig and H{\'e}l{\`e}ne Kirchner},
  booktitle={ICTAC},
  year={2004}
}
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with… 

Termination of rewriting under strategies

A termination proof method for rewriting under strategies, based on an explicit induction on the termination property, is presented and instantiated for the innermost, outermost, and local

Proving weak properties of rewriting

Computing constructor forms with non terminating rewrite programs

TLDR
An inductive procedure proving C-reducibility of rewriting, expressing that every term reduces to a constructor term on at least one of its rewriting derivations, implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating.

Termination of rewriting under strategies: a generic approach

We propose a synthesis of three induction based algorithms, we already have given to prove termination of rewrite rule based programs, respectively for the innermost, the outermost and the local

Termination of rewriting strategies: a generic approach

We propose a synthesis of three induction based algorithms, we already have given to prove termination of rewrite rule based programs, respectively for the innermost, the outermost and the local

Project-Team Protheo Constraints, Mechanized Deduction and Proofs of Software Properties

efficient execution. we study termination of rewriting, as well as to guarantee termination of programs, in the scope of our study of rule-based programming languages, and to allow reasoning in

Analysis of Rewrite-Based Access Control Policies

Rewrite rules for search database systems

TLDR
This paper develops a framework that formalizes the notion of a rewrite program, which is essentially a collection of hedge-rewriting rules, and shows that safety guarantees lfp-convergence, and that safety can be decided in polynomial time.

Modeling reducibility on ground terms using constraints

TLDR
It is shown in particular that innermost (ir)reducibility can be modeled with a particular narrowing relation and that (dis)equational constraints are issued from the most general unifiers of this narrowing relation.

Terminaison en temps moyen fini de systèmes de règles probabilistes. (Termination within a finite mean time of probabilistic rules based systems)

TLDR
Dans cette these cherche a definir un formalisme simple pour pouvoir modeliser des systemes ou se combinent des phenomenes non-deterministes and des comportements aleatoires, nous avons presente une notion de strategie pour controler l'application des regles de reecriture probabilistes.

References

SHOWING 1-10 OF 21 REFERENCES

Proving weak termination also provides the right way to terminate

TLDR
From an inductive method for proving weak innermost termination of rule-based programs, the proof principle uses an explicit induction on the termination property, to prove that any input data has at least one finite evaluation.

Induction for innermost and outermost ground termination

We propose an original approach to prove termination of innermost rewriting on ground term algebras, based on induction, abstraction and narrowing. Our method applies in particular to non-terminating

Outermost ground termination

Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems

TLDR
It is shown that termination is modular for locally confluent overlay systems and a simplified proof of the fact that completeness is a decomposable property of so-called constructor systems is obtained.

System Presentation -- CARIBOO: An induction based proof tool for termination with strategies

TLDR
Cariboo, the implementation of an inductive process recently proposed to prove termination of rewriting under strategies on ground term algebras, is described, which is implemented in ELAN, a rule based programming environment, and so can be used for proving termination of ELAN programs.

Termination of Rewriting With Strategy Annotations

TLDR
It is shown that proofs of termination can be obtained by proving innermost termination of context-sensitive rewriting CSR using existing metho ds for proving termination of CSR.

Orderings for term-rewriting systems

  • N. Dershowitz
  • Computer Science, Mathematics
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification orderings", orderings in which any term that is homeomorphically embeddable

Well-Founded Recursive Relations

We give a short constructive proof of the fact that certain binary relations > are well-founded, given a lifting ≫ a la Ferreira-Zantema and a well-founded relation ▹. This construction generalizes