Design and Results of the 1^st Satisfiability Modulo Theories Competition (SMT-COMP 2005)

Design and Results of the 1^st Satisfiability Modulo Theories Competition (SMT-COMP 2005)” by Clark Barrett, Leonardo de Moura, and Aaron Stump. Journal of Automated Reasoning, vol. 35, no. 4, Nov. 2005, pp. 373-390, Springer Netherlands.

Abstract

The Satisfiability Modulo Theories Competition (SMT-COMP) is intended to spark further advances in the decision procedures field, especially for applications in hardware and software verification. Public competitions are a well-known means of stimulating advancement in automated reasoning. Evaluation of SMT solvers entered in SMT-COMP took place while CAV 2005 was meeting. Twelve solvers were entered, 1352 benchmarks were collected in seven different divisions.

BibTeX entry:

@article{BdMS05-JAR,
author = {Clark Barrett and Leonardo de Moura and Aaron Stump},
title = {Design and Results of the {\it 1^{st}} Satisfiability Modulo
Theories Competition ({SMT-COMP} 2005)},
journal = {Journal of Automated Reasoning},
volume = {35},
number = {4},
pages = {373--390},
publisher = {Springer Netherlands},
month = nov,
year = {2005},
issn = {0168-7433},
url = {http://www.cs.nyu.edu/~barrett/pubs/BdMS05-JAR.pdf}
}


(This webpage was created with bibtex2web.)