The OpenSMT solver

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

Volumn 6015 LNCS, Issue , 2010, Pages 150-153

  Bruttomesso, Roberto ^a   Pek, Edgar ^b   Sharygina, Natasha ^a   Tsitovich, Aliaksei ^a  

^a UNIVERSITY OF LUGANO   (Switzerland)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NEW THEORY; OPEN-SOURCE; OPEN SOURCES; SMT SOLVERS; STATE OF THE ART;

COMPUTER SOFTWARE; OPEN SOURCE SOFTWARE;

ALGORITHMS;

EID: 77951556643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12002-2_12     Document Type: Conference Paper

References (8)

1. SMT-COMP, http://www.smtcomp.org
2. Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability Modulo Theories. In: Handbook on Satisfiability, vol. 185. IO Press (2009)
3. Bruttomesso, R.: An Extension of the Davis-Putnam Procedure and its Application to Preprocessing in SMT. In: SMT (2009)
4. Bruttomesso, R., Sharygina, N.: A Scalable Decision Procedure for Fixed-Width Bit-Vectors. In: ICCAD (2009)
5. 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)
6. Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. Journal of ACM 52(3), 365-473 (2005) (Pubitemid 43078377)
7. 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)
8. Wang, C., Chaudhuri, S., Gupta, A., Yang, Y.: Symbolic pruning of concurrent program executions. In: ESEC/FSE, pp. 23-32 (2009)