Journal of Automated Reasoning

, Volume 35, Issue 4, pp 373–390

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

Article

Abstract

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • Clark Barrett
    • 1
  • Leonardo de Moura
    • 2
  • Aaron Stump
    • 3
  1. 1.Department of Computer ScienceNew York UniversityNew YorkUSA
  2. 2.Computer Science LaboratorySRI InternationalMenlo ParkUSA
  3. 3.Department of Computer Science and EngineeringWashington University in St. LouisSt. LouisUSA

Personalised recommendations