Consistency checking of all different constraints over bit-vectors within a SAT solver

Authors:
Armin Biere;Robert Brummayer
Affiliations:
Johannes Kepler University, Linz, Austria;Johannes Kepler University, Linz, Austria
Venue:
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Year:
2008

Citing 9
Cited 0

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Checking Safety Properties Using Induction and a SAT-Solver

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Towards robust CNF encodings of cardinality constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Bounded model checking with QBF

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
DPLL(T) with exhaustive theory propagation and its application to difference logic

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how all different constraints (ADCs) over bit-vectors can be handled within a SAT solver. It also contains encouraging experimental results in applying this technique to encode simple path constraints in bounded model checking. Finally, we present a new compact encoding of equalities and inequalities over bit-vectors in CNF.