Pages that link to "Item:Q3636817"
From MaRDI portal
The following pages link to Proving Termination of Integer Term Rewriting (Q3636817):
Displaying 11 items.
- Loop detection by logically constrained term rewriting (Q1629968) (← links)
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Termination Graphs for Java Bytecode (Q3058449) (← links)
- SAT-based termination analysis using monotonicity constraints over the integers (Q3087439) (← links)
- (Q4993362) (← 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)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
