References

[Bie2008]

Armin Biere, PicoSAT Essentials, Journal on Satisfiability, Boolean Modelling and Computation (JSAT), Vol 4, pp. 75–97, 2008.

[DFMW2011]

David Déharbe, Pascal Fontaine, Stephan Merz, and Bruno Woltzenlogel Paleo, Exploiting Symmetry in SMT Problems, in Automated Deduction (CADE 23), LNCS 6803, pp. 222–236. Springer, Heidelberg, 2011.

[dMJ2013]

Leonardo de Moura and Dejan Jovanović, A Model-Constructing Satisfiability Calculus, in Verification, Model Checking, and Abstract Interpretation (VMCAI 2013), LNCS 7737, pp. 1–12, Springer, Heidelberg, 2013.

[DdM2006]

Bruno Dutertre and Leonardo de Moura, A Fast Linear Arithmetic Solver for DPLL(T), in Computer-Aided Verification (CAV 2006), LNCS 4144, pp. 81–94. Springer, Heidelberg, 2006.

[Dut2014]

Bruno Dutertre, Yices 2.2, in Computer-Aided Verification (CAV 2014), LNCS 8559, pp. 737–744, Springer, Heidelberg, 2014.

[Dut2015]

Bruno Dutertre, Solving Exists/Forall Problems With Yices, presented at the SMT Workshop, 2015.

[ES2003]

Niklas Eén and Niklas Sörensson, An Extensible SAT-solver, in Theory and Applications of Satisfiability Testing (SAT 2003), LNCS 2919, pp. 502–518, Springer, Heidelberg, 2004.

[NOT2006]

Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli, Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T), Journal of the ACM, Vol 53, Issue 6, pp. 937–977, November 2006.