Practical Methods for Proving Program Termination
No abstract available.
DOI 10.1007/3-540-45657-0_36
Related papers
- Proving thread termination PLDI 2007
- Proving non-termination POPL 2008
- Non-termination Proving at Scale OOPSLA 2024
- SMT-Based Active Learning of Weighted Automata CAV 2026
- Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments TACAS 2019
- Proving Termination Through Conditional Termination TACAS 2017
- Proving almost-sure termination by omega-regular decomposition PLDI 2020
- Principles of Proving Programs Correct in Gypsy POPL 1979