Pages that link to "Item:Q5389079"
From MaRDI portal
The following pages link to Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (Q5389079):
Displaying 4 items.
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- A framework for computing finite SLD trees (Q2258840) (← 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)
