Journal article
6 Years of SMT-COMP
Journal of automated reasoning, Vol.50(3), pp.243-277
03/01/2013
DOI: 10.1007/s10817-012-9246-5
Abstract
The annual Satisfiability Modulo Theories Competition (SMT-COMP) was initiated in 2005 in order to stimulate the advance of state-of-the-art techniques and tools developed by the Satisfiability Modulo Theories (SMT) community. This paper summarizes the first six editions of the competition. We present the evolution of the competition's organization and rules, show how the state of the art has improved over the course of the competition, and discuss the impact SMT-COMP has had on the SMT community and beyond. Additionally, we include an exhaustive list of all competitors, and present experimental results showing significant improvement in SMT solvers during these six years. Finally, we analyze to what extent the initial goals of the competition have been achieved, and sketch future directions for the competition.
Details
- Title: Subtitle
- 6 Years of SMT-COMP
- Creators
- Clark Barrett - New York UniversityMorgan Deters - New York UniversityLeonardo de Moura - MicrosoftAlbert Oliveras - Universitat Politècnica de CatalunyaAaron Stump - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Journal of automated reasoning, Vol.50(3), pp.243-277
- Publisher
- Springer Nature
- DOI
- 10.1007/s10817-012-9246-5
- ISSN
- 0168-7433
- eISSN
- 1573-0670
- Number of pages
- 35
- Grant note
- CNS-0551697 / U.S. National Science Foundation; National Science Foundation (NSF)
- Language
- English
- Date published
- 03/01/2013
- Academic Unit
- Computer Science
- Record Identifier
- 9984259471102771
Metrics
7 Record Views