Efficient Ranking Function-Based Termination Analysis via Bidirectional Decompositional Search
No abstract available.
Related papers
- Proving almost-sure termination by omega-regular decomposition PLDI 2020
- Termination Analysis of Probabilistic Programs Through Positivstellensatz's CAV 2016
- Towards Singular Value Decomposition for Rank-Deficient Matrices: An Efficient and Accurate Algorithm on GPU Architectures PPoPP 2026
- Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs POPL 2018
- Ranking functions for size-change termination TOPLAS 2009
- Bidirectional Higher-Rank Polymorphism with Intersection and Union Types POPL 2025
- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs ESOP 2015
- Bidirectional Type Checking for Existential Types with Higher-Rank Polymorphism ESOP 2026