Termination of rewriting

Authors:
Nachum Dershowitz
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801, U.S.A.
Venue:
Journal of Symbolic Computation
Year:
1987

Citing 21
Cited 152

Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
Full-commutation and fair-termination in equational (and combined) term-rewriting systems

Proc. of the 8th international conference on Automated deduction
An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations

Proc. of the 8th international conference on Automated deduction
Proving termination of associative commutative rewriting systems by rewriting

Proc. of the 8th international conference on Automated deduction
A simple non-termination test for the Knuth-Bendix method

Proc. of the 8th international conference on Automated deduction
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Operational and Semantic Equivalence Between Recursive Programs

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Proving termination with multiset orderings

Communications of the ACM
Computer experiments with the REVE term rewriting system generator

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Termination of Linear Rewriting Systems (Preliminary Version)

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Rewrite Methods for Clausal and Non-Clausal Theorem Proving

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Canonical Forms and Unification

Proceedings of the 5th Conference on Automated Deduction
Applied Tree Enumerations

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Termination of a Set of Rules Modulo a Set of Equations

Proceedings of the 7th International Conference on Automated Deduction
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
Handling the growth by definition of mechanical languages

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Associative-commutative rewriting

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2

On equational theories, unification, and (Un)decidability

Journal of Symbolic Computation
Rewrite, rewrite, rewrite, rewrite, rewrite...

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On laziness and optimality in lambda interpreters: tools for specification and analysis

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal methods in transformational derivation of programs

Conference proceedings on Formal methods in software development
Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method

Journal of the ACM (JACM)
Theorem proving using equational matings and rigid E-unification

Journal of the ACM (JACM)
An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Journal of the ACM (JACM)
Z-module reasoning: an equality-oriented proving method with built-in ring axioms

Journal of the ACM (JACM)
Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
Simulating the Behavior of Software Modules by Trace Rewriting

IEEE Transactions on Software Engineering
A fine-grained parallel completion procedure

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
The translation power of top-down tree-to-graph transducers

Journal of Computer and System Sciences
A theory of using history for equational systems with applications

Journal of the ACM (JACM)
The functional side of logic programming

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras

Journal of the ACM (JACM)
Simulating the behaviour of software modules by trace rewriting

ICSE '93 Proceedings of the 15th international conference on Software Engineering
Experiments with subdivision of search in distributed theorem proving

PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Controlling generalization and polyvariance in partial deduction of normal logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM (JACM)
Sacre: a constraint satisfaction problem based theorem prover

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Constraint-based termination analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple termination of context-sensitive rewriting

Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Termination of Nested and Mutually Recursive Algorithms

Journal of Automated Reasoning
Testing Positiveness of Polynomials

Journal of Automated Reasoning
Semi-Thue Systems with an Inhibitor

Journal of Automated Reasoning
Induction Proofs with Partial Functions

Journal of Automated Reasoning
General Algorithms for Permutations in Equational Inference

Journal of Automated Reasoning
Deciding the confluence of ordered term rewrite systems

ACM Transactions on Computational Logic (TOCL)
Context-sensitive rewriting strategies

Information and Computation
Modular termination proofs for rewriting using dependency pairs

Journal of Symbolic Computation
Using Term Rewriting to Verify Software

IEEE Transactions on Software Engineering
On proving left termination of constraint logic programs

ACM Transactions on Computational Logic (TOCL)
Termination of Rewriting With Strategy Annotations

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Introduction to Supercompilation

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Logic Program Specialisation

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
A New Termination Approach for Specialization

SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
Logic for Component-Based Software Development

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Negation as Failure through Abduction: Reasoning about Termination

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Sonic Partial Deduction

PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Proving Termination of Constraint Solver Programs

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Improving Homeomorphic Embedding for Online Termination

LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Solved Forms for Path Ordering Constraints

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Transforming Context-Sensitive Rewrite Systems

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Termination Proofs by Context-Dependent Interpretations

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Dependency Pairs for Equational Rewriting

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Termination of (Canonical) Context-Sensitive Rewriting

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip

FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Applying Rewriting Techniques to the Verification of Erlang Processes

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Equational Termination by Semantic Labelling

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Well-Founded Recursive Relations

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Proving Associative-Communicative Termination Using RPO-Compatible Orderings

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Ordered Resolution vs. Connection Graph Resolution

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decidable Classes of Inductive Theorems

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Loops of Superexponential Lengths in One-Rule String Rewriting

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Termination of on-demand rewriting and termination of OBJ programs

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Combining superposition, sorts and splitting

Handbook of automated reasoning
Decision Problems for Semi-Thue Systems with a Few Rules

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Basic Paramodulation and Decidable Theories

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Analysing the implicit complexity of programs

Information and Computation - Special issue: ICC '99
Formal Automatic Verification of Authentication Cryptographic Protocols

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Homeomorphic embedding for online termination of symbolic methods

The essence of computation
A dynamic approach to characterizing termination of general logic programs

ACM Transactions on Computational Logic (TOCL)
Cited References

Computer algebra handbook
Sequent combinators: a Hilbert system for the lambda calculus

Mathematical Structures in Computer Science
A predicative analysis of structural recursion

Journal of Functional Programming
On the decidability of functional uncertainty

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Verifying termination and error-freedom of logic programs with block declarations

Theory and Practice of Logic Programming
Universal guides and finiteness and symmetry of grammar processing algorithms

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Transformation techniques for context-sensitive rewrite systems

Journal of Functional Programming
A theory of totally correct logic program transformations

Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Bounded Nondeterminism of Logic Programs

Annals of Mathematics and Artificial Intelligence
Decision problems for semi-Thue systems with a few rules

Theoretical Computer Science - Insightful theory
An offline partial evaluator for curry programs

Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
Fast narrowing-driven partial evaluation for inductively sequential programs

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Logic program specialisation through partial deduction: Control issues

Theory and Practice of Logic Programming
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Proving termination of context-sensitive rewriting by transformation

Information and Computation
Ensuring the quasi-termination of needed narrowing computations

Information Processing Letters
Leanest quasi-orderings

Information and Computation
Quasi-terminating logic programs for ensuring the termination of partial evaluation

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Termination of just/fair computations in term rewriting

Information and Computation
Totally correct logic program transformations via well-founded annotations

Higher-Order and Symbolic Computation
Loop detection in term rewriting using the eliminating unfoldings

Theoretical Computer Science
Certification of Automated Termination Proofs

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Deciding Innermost Loops

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Search Techniques for Rational Polynomial Orders

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Proving Group Protocols Secure Against Eavesdroppers

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Positive supercompilation for a higher order call-by-value language

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving Termination with (Boolean) Satisfaction

Logic-Based Program Synthesis and Transformation
Termination Analysis of Logic Programs Based on Dependency Graphs

Logic-Based Program Synthesis and Transformation
Customising Web Information Systems According to User Preferences

World Wide Web
Termination Analysis of CHR Revisited

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Simultaneous checking of completeness and ground confluence for algebraic specifications

ACM Transactions on Computational Logic (TOCL)
Analysis of Rewrite-Based Access Control Policies

Electronic Notes in Theoretical Computer Science (ENTCS)
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
On Lazy Commutation

Languages: From Formal to Natural
Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
Practical methods for proving termination of general logic programs

Journal of Artificial Intelligence Research
A methodology for proving termination of general logic programs

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Unique normal forms and confluence of rewrite systems: persistence

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Termination of narrowing revisited

Theoretical Computer Science
Ordering-based strategies for horn clauses

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Automatic Proofs of Termination With Elementary Interpretations

Electronic Notes in Theoretical Computer Science (ENTCS)
Teaching Formal Methods Based on Rewriting Logic and Maude

TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Abstract Conditions for the Confluence of Explicit Substitution Calculi

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems

Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
High-level replacement units and their termination properties

Journal of Visual Languages and Computing
Size-change termination for term rewriting

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Liveness in rewriting

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Improving offline narrowing-driven partial evaluation using size-change graphs

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Automated termination analysis for logic programs by term rewriting

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Detecting non-termination of term rewriting systems using an unfolding operator

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Equational binary decision diagrams

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Improving efficiency of prolog programs by fully automated unfold/fold transformation

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Term rewriting for web information systems: termination and church-rosser property

WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Termination of narrowing in left-linear constructor systems

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Inductive synthesis of equational programs

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Solving term inequalities

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
From matrix interpretations over the rationals to matrix interpretations over the naturals

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Termination graphs for Java bytecode

Verification, induction termination analysis
Termination graphs for Java bytecode

Verification, induction termination analysis
Intuitionistic sequent-style calculus with explicit structural rules

TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Polynomial interpretations as a basis for termination analysis of logic programs

ICLP'05 Proceedings of the 21st international conference on Logic Programming
SAT solving for argument filterings

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Derivational complexity of knuth-bendix orders revisited

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Resource analysis by sup-interpretation

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
The graph rewriting calculus: confluence and expressiveness

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
The dependency triple framework for termination of logic programs

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Goal-directed and relative dependency pairs for proving the termination of narrowing

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Primitive rewriting

Processes, Terms and Cycles
Constructing rewrite-based decision procedures for embeddings and termination

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
The derivational complexity of string rewriting systems

Theoretical Computer Science
Ordinals and knuth-bendix orders

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Unification modulo chaining

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On Explicit Substitution with Names

Journal of Automated Reasoning
Automated termination proofs for Java programs with cyclic data

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs

Proceedings of the 14th symposium on Principles and practice of declarative programming
Automating Algebraic Proofs in Algebraic Logic

Fundamenta Informaticae
On One-Rule Grid Semi-Thue Systems

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Modular access control via strategic rewriting

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Jumping and escaping: Modular termination and the abstract path ordering

Theoretical Computer Science
Production-logic relations on complete lattices

Automation and Remote Control
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

Fundamenta Informaticae
On The Diversity Of Orderings On Strings

Fundamenta Informaticae
Termination Of Term Rewriting By Semantic Labelling

Fundamenta Informaticae
Better termination proving through cooperation

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Controlling Polyvariance for Specialization-based Verification

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

This survey describes methods for proving that systems of rewrite rules are terminating programs. We illustrate the use in termination proofs of various kinds of orderings on terms, including polynomial interpretations and path orderings. The effect of restrictions, such as linearity, on the form of rules is also considered. In general, however, termination is an undecidable property of rewrite systems.