Using context-sensitive rewriting for proving innermost termination of rewriting
From MaRDI portal
(Redirected from Publication:2808236)
Recommendations
Cites work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Automating the dependency pair method
- Context-Sensitive Dependency Pairs
- Context-sensitive rewriting strategies
- scientific article; zbMATH DE number 1332639 (Why is no real title available?)
- scientific article; zbMATH DE number 1948501 (Why is no real title available?)
- Improving the context-sensitive dependency graph
- Mechanizing and improving dependency pairs
- Proving operational termination of membership equational programs
- Proving termination of context-sensitive rewriting by transformation
- Proving termination of context-sensitive rewriting with MU-TERM
- Relaxing monotonicity for innermost termination
- Term Rewriting and Applications
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Termination of rewriting with strategy annotations
- Termination of term rewriting using dependency pairs
- Transformation techniques for context-sensitive rewrite systems
Cited in
(8)- Applications and extensions of context-sensitive rewriting
- A context-based approach to proving termination of evaluation
- Termination of rewriting with strategy annotations
- Proving termination properties with \textsc{mu-term}
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
- scientific article; zbMATH DE number 1948501 (Why is no real title available?)
- Proving termination of context-sensitive rewriting by transformation
This page was built for publication: Using context-sensitive rewriting for proving innermost termination of rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808236)
