Journal article
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
Formal methods in system design, Vol.31(3), pp.221-239
12/01/2007
DOI: 10.1007/s10703-007-0038-1
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.
Details
- Title: Subtitle
- Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
- Creators
- Clark Barrett - New York UniversityLeonardo de Moura - MicrosoftAaron Stump - Washington University in St. Louis
- Resource Type
- Journal article
- Publication Details
- Formal methods in system design, Vol.31(3), pp.221-239
- Publisher
- Springer Nature
- DOI
- 10.1007/s10703-007-0038-1
- ISSN
- 0925-9856
- eISSN
- 1572-8102
- Number of pages
- 19
- Language
- English
- Date published
- 12/01/2007
- Academic Unit
- Computer Science
- Record Identifier
- 9984259405902771
Metrics
2 Record Views