Pages that link to "Item:Q3522011"
From MaRDI portal
The following pages link to Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011):
Displaying 10 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- (Q4993362) (← links)
- Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures (Q5170162) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Operationally-based program equivalence proofs using LCTRSs (Q6052946) (← links)
