Pages that link to "Item:Q5389149"
From MaRDI portal
The following pages link to Automated Termination Analysis of Java Bytecode by Term Rewriting (Q5389149):
Displaying 10 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← 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)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Termination Graphs for Java Bytecode (Q3058449) (← links)
