Recommendations
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 1332639 (Why is no real title available?)
- scientific article; zbMATH DE number 1487842 (Why is no real title available?)
- scientific article; zbMATH DE number 1765702 (Why is no real title available?)
- scientific article; zbMATH DE number 2090310 (Why is no real title available?)
- scientific article; zbMATH DE number 2102742 (Why is no real title available?)
- scientific article; zbMATH DE number 1405631 (Why is no real title available?)
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Approximations for strategies and termination
- Automating the dependency pair method
- Context-sensitive rewriting strategies
- Foundations of Software Science and Computation Structures
- From Outermost to Context-Sensitive Rewriting
- Frontiers of Combining Systems
- Improving Context-Sensitive Dependency Pairs
- Improving the context-sensitive dependency graph
- Logic Programming
- Logic for Programming, Artificial Intelligence, and Reasoning
- Matrix interpretations for proving termination of term rewriting
- Mechanizing and improving dependency pairs
- Modular termination proofs for rewriting using dependency pairs
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Operational termination of membership equational programs: the order-sorted way
- Polynomials over the reals in proofs of termination : from theory to practice
- Proving innermost normalisation automatically
- Proving operational termination of membership equational programs
- Proving termination of context-sensitive rewriting by transformation
- Proving termination of context-sensitive rewriting with MU-TERM
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Relaxing monotonicity for innermost termination
- Rewriting Techniques and Applications
- Semantic foundations for generalized rewrite theories
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Termination of context-sensitive rewriting
- Termination of lazy rewriting revisited
- Termination of term rewriting using dependency pairs
- Transformation techniques for context-sensitive rewrite systems
- Tyrolean termination tool: techniques and features
- Usable Rules for Context-Sensitive Rewrite Systems
Cited in
(19)- Proving termination properties with \textsc{mu-term}
- 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
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Improving the context-sensitive dependency graph
- Mechanizing and improving dependency pairs
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Usable Rules for Context-Sensitive Rewrite Systems
- scientific article; zbMATH DE number 2090310 (Why is no real title available?)
- Automatic proofs of termination with elementary interpretations
Describes a project that uses
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)
