Journal of Automated Reasoning

, Volume 35, Issue 4, pp 373-390

First online:

Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)

  • Clark BarrettAffiliated withDepartment of Computer Science, New York University
  • , Leonardo de MouraAffiliated withComputer Science Laboratory, SRI International
  • , Aaron StumpAffiliated withDepartment of Computer Science and Engineering, Washington University in St. Louis Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


The Satisfiability Modulo Theories Competition (SMT-COMP) is intended to spark further advances in the decision procedures field, especially for applications in hardware and software verification. Public competitions are a well-known means of stimulating advancement in automated reasoning. Evaluation of SMT solvers entered in SMT-COMP took place while CAV 2005 was meeting. Twelve solvers were entered; 1,352 benchmarks were collected in seven different divisions.

Key words

competition decision procedures satisfiability modulo theories