6 Years of SMT-COMP

6 Years of SMT-COMP” by Clark Barrett, Morgan Deters, Leonardo de Moura, Albert Oliveras, and Aaron Stump. Journal of Automated Reasoning, vol. 50, no. 3, Mar. 2013, pp. 243-277, Springer Netherlands.

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 Theories; Competition; Experimental evaluation

BibTeX entry:

@article{BDdM+13,
   author = {Clark Barrett and Morgan Deters and Leonardo de Moura and
	Albert Oliveras and Aaron Stump},
   title = {6 Years of {SMT-COMP}},
   journal = {Journal of Automated Reasoning},
   volume = {50},
   number = {3},
   pages = {243--277},
   publisher = {Springer Netherlands},
   month = mar,
   year = {2013},
   url = {http://www.cs.nyu.edu/~barrett/pubs/BDdM+13.pdf}
}

(This webpage was created with bibtex2web.)