Liveness with Incomprehensible Ranking
No abstract available.
Related papers
- Liveness with Invisible Ranking VMCAI 2004
- Implicit Rankings for Verifying Liveness Properties in First-Order Logic TACAS 2025
- Mostly Automated Verification of Liveness Properties for Distributed Protocols with Ranking Functions POPL 2024
- Toward Liveness Proofs at Scale CAV 2024
- Termination Analysis of Probabilistic Programs Through Positivstellensatz's CAV 2016
- Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs POPL 2018
- Reducing liveness to safety in first-order logic POPL 2018
- Proving almost-sure termination by omega-regular decomposition PLDI 2020