Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)

Clark Barrett, Leonardo De Moura, Aaron Stump

Research output: Contribution to journalArticle

Abstract

The Satisfiability Modulo Theories Competition (SMT-COMP) arose from the SMT-LIB initiative to spur adoption of common, community-designed formats, and to spark further advances in satisfiability modulo theories (SMT). The first SMT-COMP was held in 2005 as a satellite event of CAV 2005. SMT-COMP 2006 was held August 17-19, 2006, as a satellite event of CAV 2006. This paper describes the rules and competition format for SMT-COMP 2006, the benchmarks used, the participants, and the results.

Original languageEnglish (US)
Pages (from-to)221-239
Number of pages19
JournalFormal Methods in System Design
Volume31
Issue number3
DOIs
StatePublished - Dec 1 2007

Keywords

  • Automated theorem proving
  • Competition
  • Decision procedures
  • SMT
  • Satisfiability modulo theories

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)'. Together they form a unique fingerprint.

  • Cite this