The following pages link to Jera Hensel (Q1647966):
Displaying 8 items.
- Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (Q1647969) (← 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)
- Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
- Proving Termination and Memory Safety for Programs with Pointer Arithmetic (Q3192191) (← links)
- Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution (Q4571133) (← links)
- Inferring Lower Bounds for Runtime Complexity (Q5277889) (← links)
