Proving termination of context-sensitive rewriting by transformation
From MaRDI portal
Publication:859833
DOI10.1016/j.ic.2006.07.001zbMath1171.68514OpenAlexW2093571287MaRDI QIDQ859833
Publication date: 22 January 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.07.001
Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Related Items
Polynomials over the reals in proofs of termination : from theory to practice ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ Automatic Proofs of Termination With Elementary Interpretations ⋮ Proving operational termination of membership equational programs ⋮ Context-sensitive dependency pairs ⋮ Proving Termination Properties with mu-term ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ On-demand strategy annotations revisited: an improved on-demand evaluation strategy ⋮ Improving the Context-sensitive Dependency Graph ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM ⋮ Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems ⋮ Termination of Lazy Rewriting Revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OBJ3
- Orderings for term-rewriting systems
- Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings.
- Relaxing monotonicity for innermost termination
- Termination of rewriting
- A note on simplification orderings
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Generalized sufficient conditions for modular termination of rewriting
- Simple termination is difficult
- Maude: specification and programming in rewriting logic
- Context-sensitive rewriting strategies
- Modular termination proofs for rewriting using dependency pairs
- Transfinite reductions in orthogonal term rewriting systems
- Specification and proof in membership equational logic
- Termination of term rewriting using dependency pairs
- Modular and incremental automated termination proofs
- Lazy Rewriting and Context-Sensitive Rewriting
- Termination of Rewriting with Strategy Annotations
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Termination of context-sensitive rewriting
- Foundations of Software Science and Computation Structures
- Polynomials over the reals in proofs of termination : from theory to practice
- Artificial Intelligence and Symbolic Computation
- Transformation techniques for context-sensitive rewrite systems
- Term Rewriting and Applications
- Logic for Programming, Artificial Intelligence, and Reasoning
- Rewriting Techniques and Applications
This page was built for publication: Proving termination of context-sensitive rewriting by transformation
