The following pages link to Ctrl (Q25785):
Displaying 6 items.
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Rewriting Modulo SMT and Open System Analysis (Q2945139) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- (Q4993362) (← links)