Better Under-Approximation of Programs by Hiding Variables
Abstract elided by the publisher.
Related papers
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra POPL 2013
- Lifting abstract interpreters to quantified logical domains POPL 2008
- Fast Approximations of Quantifier Elimination CAV 2023
- Verification under TSO with an infinite Data Domain TACAS 2024
- Thread-Modular Analysis of Release-Acquire Concurrency SAS 2021
- Data abstraction and information hiding TOPLAS 2002
- Verification under Intel-x86 with Persistency PLDI 2024
- From Under-Approximations to Over-Approximations and Back TACAS 2012