Closed and Logical Relations for Over- and Under-Approximation of Powersets
No abstract available.
Related papers
- ANOSY: approximated knowledge synthesis with refinement types for declassification PLDI 2022
- Limits and Difficulties in the Design of Under-Approximation Abstract Domains TOPLAS 2024
- Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction SAS 2014
- A Program Logic for Under-approximating Worst-case Resource Usage ESOP 2026
- Lifting abstract interpreters to quantified logical domains POPL 2008
- Under-Approximation for Scalable Bug Detection (Keynote) CPP 2024
- Folding left and right over Peano numbers JFP 2019
- Approximate Relational Reasoning for Higher-Order Probabilistic Programs POPL 2025