“Design and Results of the 2^nd Satisfiability Modulo Theories Competition (SMT-COMP 2006)” by Clark Barrett, Leonardo de Moura, and Aaron Stump. Formal Methods in System Design, vol. 31, no. 3, Dec. 2007, pp. 221-239, Springer Netherlands.
The Satisï¬ability Modulo Theories Competition (SMT-COMP) arose from the SMT-LIB initiative to spur adoption of common, community-designed formats, and to spark further advances in satisï¬ability modulo theories (SMT). The ï¬rst SMT-COMP was held in 2005 as a satellite event of CAV 2005. SMT-COMP 2006 was held August 17 - 19, 2006, as a satellite event of CAV 2006. This paper describes the rules and competition format for SMT-COMP 2006, the benchmarks used, the participants, and the results.
BibTeX entry:
@article{BdMS07, author = {Clark Barrett and Leonardo de Moura and Aaron Stump}, title = {Design and Results of the {\it 2^{nd}} Satisfiability Modulo Theories Competition ({SMT-COMP} 2006)}, journal = {Formal Methods in System Design}, volume = {31}, number = {3}, pages = {221--239}, publisher = {Springer Netherlands}, month = dec, year = {2007}, issn = {0925-9856}, doi = {10.1007/s10703-007-0038-1}, url = {http://theory.stanford.edu/~barrett/pubs/BdMS07.pdf} }
(This webpage was created with bibtex2web.)