Sharpening constraint programming approaches for bit-vector theory
From MaRDI portal
Publication:2011567
Recommendations
- Towards satisfiability modulo parametric bit-vectors
- On solving quantified bit-vector constraints using invertibility conditions
- An alternative to SAT-based approaches for bit-vectors
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- An alternative eager encoding of the all-different constraint over bit-vectors
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Efficiently solving quantified bit-vector formulas
- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors
- Abstraction of bit-vector operations for BDD-based SMT solvers
Cites work
- scientific article; zbMATH DE number 1696810 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- A Decision Procedure for Bit-Vectors and Arrays
- A bit-vector solver with word-level propagation
- A constraint solver based on abstract domains
- An alternative to SAT-based approaches for bit-vectors
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Deciding Bit-Vector Arithmetic with Abstraction
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
- Lazy Abstraction with Interpolants
- Lazy abstraction
- Simplification by Cooperating Decision Procedures
- Social processes and proofs of theorems and programs
- Solving quantified verification conditions using satisfiability modulo theories
- Taking satisfiability to the next level with Z3 (abstract)
- The MathSAT5 SMT solver
- Theory and Applications of Satisfiability Testing
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(12)- On the usefulness of linear modular arithmetic in constraint programming
- Wombit: a portfolio bit-vector solver using word-level propagation
- Exploiting binary floating-point representations for constraint propagation
- An alternative to SAT-based approaches for bit-vectors
- A bit-vector solver with word-level propagation
- Solving bitvectors with MCSAT: explanations from bits and pieces
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- Deciding Bit-Vector Formulas with mcSAT
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
- Constraint satisfaction through GBP-guided deliberate bit flipping
- A bitopological view on cocompact extensions
Describes a project that uses
Uses Software
This page was built for publication: Sharpening constraint programming approaches for bit-vector theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011567)
