Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Computational Techniques of the Simplex Method
Computational Techniques of the Simplex Method
Fast congruence closure and extensions
Information and Computation
Splitting on demand in SAT modulo theories
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
SMT techniques for fast predicate abstraction
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Fast and flexible difference constraint propagation for DPLL(T)
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
BACH 2: Bounded reachAbility CHecker for compositional linear hybrid systems
Proceedings of the Conference on Design, Automation and Test in Europe
Small formulas for large programs: on-line constraint simplification in scalable static analysis
SAS'10 Proceedings of the 17th international conference on Static analysis
Information flow analysis via path condition refinement
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Satisfiability modulo theories: introduction and applications
Communications of the ACM
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
Formal Methods in System Design
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints
Journal of Automated Reasoning
Automated testing and debugging of SAT and QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Conflict directed lazy decomposition
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Integration of SMT-solvers in B and Event-B development environments
Science of Computer Programming
Asp modulo csp: The clingcon system
Theory and Practice of Logic Programming
A new look at BDDs for Pseudo-Boolean constraints
Journal of Artificial Intelligence Research
Cassandra: proactive conflict minimization through optimized task scheduling
Proceedings of the 2013 International Conference on Software Engineering
A constraint-based approach to solving games on infinite graphs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.02 |
This is the first system description of the Barcelogic SMT solver, which implements all techniques that our group has been developing over the last four years as well as state-of-the-art features developed by other research groups. We pay special attention to the theory solvers and to functionalities that are not common in SMT solvers.