@article{5abb2af41e3342e68197084684d39197,
title = "Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)",
abstract = "The Satisfiability 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 satisfiability modulo theories (SMT). The first 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.",
keywords = "Automated theorem proving, Competition, Decision procedures, SMT, Satisfiability modulo theories",
author = "Clark Barrett and {De Moura}, Leonardo and Aaron Stump",
note = "Funding Information: Acknowledgements SMT-COMP would not have been possible without the invaluable support, feedback, and participation of the entire SMT community, with special thanks to Cesare Tinelli and Silvio Ranise, the leaders of the SMT-LIB initiative. The organizers would also like to thank SRI International for use of the cluster on which the competition was run. Thanks also to Thomas Ball and Robert Jones, the program chairs of CAV 2006, for their support of SMT-COMP 2006 as a satellite event. Finally, the organizers wish to acknowledge the support of the U.S. National Science Foundation, under contract CNS-0551697, for SMT-COMP 2007 and (anticipated) 2008.",
year = "2007",
month = dec,
doi = "10.1007/s10703-007-0038-1",
language = "English (US)",
volume = "31",
pages = "221--239",
journal = "Formal Methods in System Design",
issn = "0925-9856",
publisher = "Springer Netherlands",
number = "3",
}