Sharpening Constraint Programming Approaches for Bit-Vector Theory

@inproceedings{Chihani2017SharpeningCP,
  title={Sharpening Constraint Programming Approaches for Bit-Vector Theory},
  author={Zakaria Chihani and B. Marre and François Bobot and S{\'e}bastien Bardin},
  booktitle={CPAIOR},
  year={2017}
}
We address the challenge of developing efficient Constraint Programming-based approaches for solving formulas over the quantifier-free fragment of the theory of bitvectors (BV), which is of paramount importance in software verification. We propose CP(BV), a highly efficient BV resolution technique built on carefully chosen anterior results sharpened with key original features such as thorough domain combination or dedicated labeling. Extensive experimental evaluations demonstrate that CP(BV) is… Expand

References

SHOWING 1-10 OF 48 REFERENCES
An Alternative to SAT-Based Approaches for Bit-Vectors
A Lazy and Layered SMT($\mathcal{BV}$) Solver for Hard Industrial Verification Problems
Deciding Bit-Vector Arithmetic with Abstraction
A Decision Procedure for Bit-Vectors and Arrays
LPSAT: a unified approach to RTL satisfiability
RTL-datapath verification using integer linear programming
  • R. Brinkmann, R. Drechsler
  • Mathematics, Computer Science
  • Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design
  • 2002
A Bit-Vector Solver with Word-Level Propagation
The MathSAT5 SMT Solver
Functional Test Generation using Constraint Logic Programming
...
1
2
3
4
5
...