The Barcelogic SMT solver: Tool paper

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5123 LNCS, Issue , 2008, Pages 294-298

  Bofill, Miquel ^a   Nieuwenhuis, Robert ^b   Oliveras, Albert ^b   Rodríguez Carbonell, Enric ^b   Rubio, Albert ^b  

^a UNIVERSITY OF GIRONA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED VERIFICATION; INTERNATIONAL CONFERENCES; RE SEARCH GROUP; SYSTEM DESCRIPTION;

COMPUTER AIDED ANALYSIS; SURFACE MOUNT TECHNOLOGY;

SPEECH TRANSMISSION;

EID: 48949090405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_27     Document Type: Conference Paper

References (15)

1. +05] Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T., van Rossum, P., Schulz, S., Sebastiani, R.: The MathSAT 3 System. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 315-321. Springer, Heidelberg (2005)
2. [BNOT06] Barrett, C., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Splitting on Demand in SAT Modulo Theories. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 512-526. Springer, Heidelberg (2006)
3. [DdM06] Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
4. [ES04] Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
5. [GMP] The GNU MP Bignum Library, http://gmplib.org/
6. [LNO06] Lahiri, S.K., Nieuwenhuis, R., Oliveras, A.: SMT Techniques for Fast Predicate Abstraction. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 424-437. Springer, Heidelberg (2006)
7. [Mar86] Maros, I.: Computational Techniques of the Simplex Method. Kluwer's International Series (2003)
8. +01] Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: 38th Design Automation Conference, DAC 2001, pp. 530-535. ACM Press, New York (2001)
9. [NO05] Nieuwenhuis, R., Oliveras, A.: DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 321-334. Springer, Heidelberg (2005)
10. [NO06] Nieuwenhuis, R., Oliveras, A.: On SATModulo Theories and Optimization Problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 156-169. Springer, Heidelberg (2006)
11. [NO07] Nieuwenhuis, R., Oliveras, A.: Fast Congruence Closure and Extensions. Information and Computation, IC 2005(4), 557-580 (2007)
12. [NOT06] Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM, J. ACM 53(6), 937-977 (2006)
13. [RS04] Rueß, H., Shankar, N.: Solving Linear Arithmetic Constraints. Technical Report CSL-SRI-04-01, SRI International (2004)
14. [SM06] Cotton, S., Maler, O.: Fast and Flexible Difference Constraint Propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 170-183. Springer, Heidelberg (2006)
15. [TR05] Tinelli, C., Ranise, S.: SMT-LIB: The Satisfiability Modulo Theories Library (2005), http://goedel.cs.uiowa.edu/smtlib/