The Barcelogic SMT Solver Tool Paper
暂无分享,去创建一个
[1] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.
[2] Albert Oliveras,et al. SMT Techniques for Fast Predicate Abstraction , 2006, CAV.
[3] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[4] Albert Oliveras,et al. Fast congruence closure and extensions , 2007, Inf. Comput..
[5] Bruno Dutertre,et al. A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.
[6] I. Maros. Computational Techniques of the Simplex Method , 2002 .
[7] Cesare Tinelli,et al. Splitting on Demand in SAT Modulo Theories , 2006, LPAR.
[8] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[9] Albert Oliveras,et al. DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic , 2005, CAV.
[10] Oded Maler,et al. Fast and Flexible Difference Constraint Propagation for DPLL(T) , 2006, SAT.
[11] Albert Oliveras,et al. On SAT Modulo Theories and Optimization Problems , 2006, SAT.
[12] Marco Bozzano,et al. The MathSAT 3 System , 2005, CADE.