Automatically Proving Program Termination
No abstract available.
Related papers
- TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language SAS 1997
- KoAT: Automatic Complexity and Termination Analysis of Integer Programs CAV 2026
- AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution) TACAS 2022
- Proving almost-sure termination by omega-regular decomposition PLDI 2020
- Proving thread termination PLDI 2007
- Automatically disproving fair termination of higher-order functional programs ICFP 2016
- Decision Procedures for Automating Termination Proofs VMCAI 2011
- AProVE(KoAT+LoAT) - (Competition Contribution) TACAS 2025