Solving $\mathrm {LIA} ^\star $ Using Approximations
No abstract available.
Related papers
- Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems PLDI 2020
- Local Search for SMT on Linear Integer Arithmetic CAV 2022
- Constraint-Based Relational Verification CAV 2021
- Predicate Abstraction and CEGAR for $\nu \mathrm {HFL}_\mathbb {Z}$ Validity Checking SAS 2020
- Nonlinear Craig Interpolant Generation CAV 2020
- NNV: The Neural Network Verification Tool for Deep Neural Networks and Learning-Enabled Cyber-Physical Systems CAV 2020
- Parallel SMT Solving via Iterative Tree Partitioning TACAS 2026
- i _\mathrm Rank : A Variable Order Metric for DEDS Subject to Linear Invariants TACAS 2019