A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Some characteristics of strong innermost normalization
Theoretical Computer Science
Termination of Context-Sensitive Rewriting
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Proving Innermost Normalisation Automatically
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Simplification and termination of strategies in rule-based languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
A proof of weak termination providing the right way to terminate
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Rule-based programming and proving: the ELAN experience outcomes
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Orderings and constraints: theory and practice of proving termination
Rewriting Computation and Proof
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |
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 abstraction mechanism lies on satisfiability of ordering constraints. Thanks to the power of induction, these 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.