Transition predicate abstraction and fair termination
No abstract available.
Related papers
- Transition predicate abstraction and fair termination POPL 2005
- Transition Invariants and Transition Predicate Abstraction for Program Termination TACAS 2011
- Automatically disproving fair termination of higher-order functional programs ICFP 2016
- Recurrence Sets for Proving Fair Non-termination under Axiomatic Memory Consistency Models POPL 2026
- Finitary Fairness TOPLAS 1998
- Temporal verification of higher-order functional programs POPL 2016
- Stratified Guarded First-Order Transition Systems SAS 2020
- Compositional Specification and Verification of Distributed Systems TOPLAS 1994