Context-sensitive dependency pairs
From MaRDI portal
Publication:989290
DOI10.1016/J.IC.2010.03.003zbMATH Open1206.68158OpenAlexW1978256848MaRDI QIDQ989290FDOQ989290
Authors: Beatriz Alarcón, Raúl Gutiérrez, 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
Recommendations
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Proving termination of context-sensitive rewriting with MU-TERM
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Rewriting Techniques and Applications
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Title not available (Why is that?)
- Proving operational termination of membership equational programs
- Automating the dependency pair method
- Semantic foundations for generalized rewrite theories
- Title not available (Why is that?)
- Operational termination of membership equational programs: the order-sorted way
- Logic Programming
- Frontiers of Combining Systems
- Logic for Programming, Artificial Intelligence, and Reasoning
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- Termination of context-sensitive rewriting
- Title not available (Why is that?)
- Polynomials over the reals in proofs of termination : from theory to practice
- Context-sensitive rewriting strategies
- Termination of lazy rewriting revisited
- From Outermost to Context-Sensitive Rewriting
- Proving innermost normalisation automatically
- Improving Context-Sensitive Dependency Pairs
- Improving the context-sensitive dependency graph
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- Transformation techniques for context-sensitive rewrite systems
- Relaxing monotonicity for innermost termination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving termination of context-sensitive rewriting by transformation
- Approximations for strategies and termination
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Usable Rules for Context-Sensitive Rewrite Systems
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Cited In (19)
- Twenty years of rewriting logic
- Guessing singular dependencies
- mu-term: Verify Termination Properties Automatically (System Description)
- Context-Sensitive Dependency Pairs
- Proving termination of context-sensitive rewriting with MU-TERM
- Dependent pairs
- Improving Context-Sensitive Dependency Pairs
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Applications and extensions of context-sensitive rewriting
- A static higher-order dependency pair framework
- Proving termination in the context-sensitive dependency pair framework
- Improving the context-sensitive dependency graph
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Mechanizing and improving dependency pairs
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Usable Rules for Context-Sensitive Rewrite Systems
- Title not available (Why is that?)
- Automatic proofs of termination with elementary interpretations
- Proving termination properties with \textsc{mu-term}
Uses Software
This page was built for publication: Context-sensitive dependency pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989290)
