Ramsey vs. Lexicographic Termination Proving
No abstract available.
Related papers
- Proving almost-sure termination by omega-regular decomposition PLDI 2020
- Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs POPL 2018
- Ramsey Quantifiers in Linear Arithmetics POPL 2024
- Probabilistic Termination: Soundness, Completeness, and Compositionality POPL 2015
- Bit-Precise Procedure-Modular Termination Analysis TOPLAS 2018
- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs ESOP 2015
- On Multiphase-Linear Ranking Functions CAV 2017
- Synthesis of ranking functions using extremal counterexamples PLDI 2015