On proving inductive properties of abstract data types
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
How to Prove Algebraic Inductive Hypotheses Without Induction
Proceedings of the 5th Conference on Automated Deduction
Termination orderings for associative-commutative rewriting systems
Journal of Symbolic Computation
Writing Larch interface language specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Symbolic Computation
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
Inductive methods for reasoning about abstract data types
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Completion of integral polynomials by AC-term completion
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Formal specification and verification of hardware: a comparative case study
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Completion of a set of rules modulo a set of equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Rewriting systems on FP expressions that reduce the number of sequences they yield
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Proving Termination Using Recursive Path Orders and SAT Solving
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Church-rosser properties of weakly terminating term rewriting systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Associative-commutative rewriting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Inductive synthesis of equational programs
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
Unifying the Knuth-Bendix, recursive path and polynomial orders
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
A term rewriting system generator called REVE is described. REVE builds confluent and uniformly terminating term rewriting systems from sets of equations. Particular emphasis is placed on mechanization of termination proof. Indeed, REVE is one of the few such systems which can actually be called automatic because termination is fully integrated into the algorithms. REVE uses an incremental termination method based on recursive decomposition ordering which constructs the termination proof step by step from the presentation of the set of equations and which requires little knowledge of termination methods from the user. All examples from this paper are taken from abstract data type specifications.