Pages that link to "Item:Q2362494"
From MaRDI portal
The following pages link to Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494):
Displayed 2 items.
- Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (Q1647969) (← links)
- Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free (Q2058383) (← links)