Solving quantified bit-vectors using invertibility conditions
From MaRDI portal
Recommendations
Cited in
(16)- Abstraction of bit-vector operations for BDD-based SMT solvers
- Preface of the special issue on the conference on computer-aided verification 2018
- On solving quantified bit-vector constraints using invertibility conditions
- Towards satisfiability modulo parametric bit-vectors
- Solving bitvectors with MCSAT: explanations from bits and pieces
- Towards bit-width-independent proofs in SMT solvers
- Efficiently solving quantified bit-vector formulas
- Solving quantified bit-vector formulas using binary decision diagrams
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors
- Invertibility conditions for floating-point formulas
- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment
- Formal Verification of Bit-Vector Invertibility Conditions in Coq
- Truncating abstraction of bit-vector operations for BDD-based SMT solvers
- Solving hard Mizar problems with instantiation and strategy invention
- The QSMA algorithm for quantifiers in SMT
This page was built for publication: Solving quantified bit-vectors using invertibility conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039405)