The following pages link to KITTeL (Q28906):
Displayed 10 items.
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (Q1647969) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← 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)
- System-level state equality detection for the formal dynamic verification of legacy distributed applications (Q2413022) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
- (Q5389070) (← links)