Usable Rules for Context-Sensitive Rewrite Systems
From MaRDI portal
(Redirected from Publication:3522013)
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 1948501 (Why is no real title available?)
- Context-Sensitive Dependency Pairs
- Context-sensitive rewriting strategies
- Generalized sufficient conditions for modular termination of rewriting
- Improving the context-sensitive dependency graph
- Logic for Programming, Artificial Intelligence, and Reasoning
- Mechanizing and improving dependency pairs
- Modular and incremental automated termination proofs
- Modular termination proofs for rewriting using dependency pairs
- 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
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- 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
(6)- scientific article; zbMATH DE number 6744203 (Why is no real title available?)
- Improving Context-Sensitive Dependency Pairs
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Syntax-guided rewrite rule enumeration for SMT solvers
- Context-sensitive dependency pairs
- Usable Rules for Context-Sensitive Rewrite Systems
This page was built for publication: Usable Rules for Context-Sensitive Rewrite Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522013)
