SMT-COMP: Satisfiability modulo theories competition

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 20-23

  Barrett, Clark ^a   De Moura, Leonardo ^b   Stump, Aaron ^c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b SRI INTERNATIONAL   (United States)

^c WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SATISFIABILITY MODULO THEORIES;

FORMAL LOGIC;

EID: 26444489953     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_4     Document Type: Conference Paper

References (7)

1. D. Le Berre and L. Simon. The essentials of the SAT 2003 competition. In Sixth International Conference on Theory and Applications of Satisfiability Testing, volume 2919 of LNCS, pages 452-467. Springer-Verlag, 2003.
2. H. Jin, H. Han, and F. Somenzi. Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit. In L. Zuck and N. Halbwachs, editors, 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2005.
3. S. Lerner, T. Millstein, and C. Chambers. Automatically Proving the Correctness of Compiler Optimizations. In R. Gupta, editor, In ACM SIGPLAN Conference on Programming Language Design and Implementation, 2003. received best paper award.
4. F.J. Pelletier, G. Sutcliffe, and C.B. Suttner. The Development of CASC. AI Communications, 15(2-3):79-90, 2002.
5. Silvio Ranise and Cesare Tinelli. The SMT-LIB standard, version 1.1, 2005. Available from the "Documents" section of http://combination.cs. uiowa.edu/smtlib.
6. M. Velev and R. Bryant. Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors. Journal of Symbolic Computation, 35(2):73-106, February 2003.
7. H. Zantema, 2005. personal communication.