Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement
No abstract available.
Related papers
- A Practical and Complete Approach to Predicate Refinement TACAS 2006
- Nested refinements: a logic for duck typing POPL 2012
- Stratified Guarded First-Order Transition Systems SAS 2020
- Breaking the Negative Cycle: Exploring the Design Space of Stratification for First-Class Datalog Constraints ECOOP 2023
- Predicate Abstraction for Relaxed Memory Models SAS 2013
- The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency POPL 2022
- Low-overhead and fully automated statistical debugging with abstraction refinement OOPSLA 2016
- Refinement kinds: type-safe programming with practical type-level computation OOPSLA 2019