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 2007

Fingerprint

Annual
Modulo
Satellites
Electric sparks
Design
Trace
Benchmark

Keywords

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006). / Barrett, Clark; De Moura, Leonardo; Stump, Aaron.

In: Formal Methods in System Design, Vol. 31, No. 3, 12.2007, p. 221-239.

Research output: Contribution to journalArticle

Barrett, Clark ; De Moura, Leonardo ; Stump, Aaron. / Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006). In: Formal Methods in System Design. 2007 ; Vol. 31, No. 3. pp. 221-239.
@article{5abb2af41e3342e68197084684d39197,
title = "Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)",
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.",
keywords = "Automated theorem proving, Competition, Decision procedures, Satisfiability modulo theories, SMT",
author = "Clark Barrett and {De Moura}, Leonardo and Aaron Stump",
year = "2007",
month = "12",
doi = "10.1007/s10703-007-0038-1",
language = "English (US)",
volume = "31",
pages = "221--239",
journal = "Formal Methods in System Design",
issn = "0925-9856",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

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

AU - Barrett, Clark

AU - De Moura, Leonardo

AU - Stump, Aaron

PY - 2007/12

Y1 - 2007/12

N2 - 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.

AB - 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.

KW - Automated theorem proving

KW - Competition

KW - Decision procedures

KW - Satisfiability modulo theories

KW - SMT

UR - http://www.scopus.com/inward/record.url?scp=35648937646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35648937646&partnerID=8YFLogxK

U2 - 10.1007/s10703-007-0038-1

DO - 10.1007/s10703-007-0038-1

M3 - Article

VL - 31

SP - 221

EP - 239

JO - Formal Methods in System Design

JF - Formal Methods in System Design

SN - 0925-9856

IS - 3

ER -