Termination of context-sensitive rewriting
From MaRDI portal
Recommendations
Cited in
(33)- Over-approximating terms reachable by context-sensitive rewriting
- Context-sensitive rewriting strategies
- Derivational complexity and context-sensitive Rewriting
- Proving operational termination of membership equational programs
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Induction for termination with local strategies
- Lazy rewriting and context-sensitive rewriting
- Improving the context-sensitive dependency graph
- Proving termination of context-sensitive rewriting with MU-TERM
- Termination of lazy rewriting revisited
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
- From Outermost to Context-Sensitive Rewriting
- Specifying termination in CSP
- scientific article; zbMATH DE number 1948501 (Why is no real title available?)
- scientific article; zbMATH DE number 2090080 (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?)
- mu-term: Verify Termination Properties Automatically (System Description)
- Foundations of Software Science and Computation Structures
- Polynomials over the reals in proofs of termination : from theory to practice
- Lazy productivity via termination
- Transformation techniques for context-sensitive rewrite systems
- Syntax-guided termination analysis
- Fundamentals of context-sensitive rewriting
- Wanda -- a higher-order termination tool (system description)
- Towards an algebraic theory of typed mobile processes
- Relaxing monotonicity for innermost termination
- Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)
- Proving termination of context-sensitive rewriting by transformation
- On tree automata that certify termination of left-linear term rewriting systems
- Context-sensitive dependency pairs
This page was built for publication: Termination of context-sensitive rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594226)
