Pages that link to "Item:Q5200103"
From MaRDI portal
The following pages link to On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103):
Displaying 4 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
