Journal of Automated Reasoning

, Volume 50, Issue 3, pp 243–277

6 Years of SMT-COMP

  • Clark Barrett
  • Morgan Deters
  • Leonardo de Moura
  • Albert Oliveras
  • Aaron Stump
Article

DOI: 10.1007/s10817-012-9246-5

Cite this article as:
Barrett, C., Deters, M., de Moura, L. et al. J Autom Reasoning (2013) 50: 243. 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.

Keywords

SAT Modulo TheoriesCompetitionExperimental evaluation

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  • Clark Barrett
    • 1
  • Morgan Deters
    • 1
  • Leonardo de Moura
    • 2
  • Albert Oliveras
    • 3
  • Aaron Stump
    • 4
  1. 1.New York UniversityNew YorkUSA
  2. 2.Microsoft ResearchRedmondUSA
  3. 3.Technical University of CataloniaBarcelonaSpain
  4. 4.The University of IowaIowa CityUSA