Context-sensitive dependency pairs
From MaRDI portal
Publication:989290
DOI10.1016/J.IC.2010.03.003zbMath1206.68158OpenAlexW1978256848MaRDI QIDQ989290
Raúl Gutiérrez, Beatriz Alarcón, Salvador Lucas
Publication date: 19 August 2010
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2010.03.003
Related Items (7)
mu-term: Verify Termination Properties Automatically (System Description) ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Twenty years of rewriting logic ⋮ Automatic Proofs of Termination With Elementary Interpretations ⋮ Proving Termination Properties with mu-term ⋮ Applications and extensions of context-sensitive rewriting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxing monotonicity for innermost termination
- Proving termination of context-sensitive rewriting by transformation
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Context-sensitive rewriting strategies
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- Proving operational termination of membership equational programs
- Automating the dependency pair method
- Semantic foundations for generalized rewrite theories
- Improving the Context-sensitive Dependency Graph
- Proving Termination of Context-Sensitive Rewriting with MU-TERM
- Termination of Lazy Rewriting Revisited
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Usable Rules for Context-Sensitive Rewrite Systems
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- From Outermost to Context-Sensitive Rewriting
- Proving innermost normalisation automatically
- Termination of context-sensitive rewriting
- Operational Termination of Membership Equational Programs: the Order-Sorted Way
- Foundations of Software Science and Computation Structures
- Logic Programming
- Polynomials over the reals in proofs of termination : from theory to practice
- Frontiers of Combining Systems
- Improving Context-Sensitive Dependency Pairs
- Transformation techniques for context-sensitive rewrite systems
- Logic for Programming, Artificial Intelligence, and Reasoning
- Rewriting Techniques and Applications
This page was built for publication: Context-sensitive dependency pairs
