Domain Compression for Complete Abstractions
No abstract available.
Related papers
- babble: Learning Better Abstractions with E-Graphs and Anti-unification POPL 2023
- Deciding Program Properties via Complete Abstractions on Bounded Domains SAS 2022
- A GPU Tree Database for Many-Core Explicit State Space Exploration TACAS 2023
- High-performance Visual Semantics Compression for AI-Driven Science PPoPP 2025
- A Logical Model for Relational Abstract Domains TOPLAS 1998
- Offline compression for on-chip ram PLDI 2007
- SART: Sign-Absolute Reformulation Theory for Binary Variable Reduction in Neural Network Verification OOPSLA 2026
- Timestamped Whole Program Path Representation and its Applications PLDI 2001