Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)

Clark Barrett; Leonardo de Moura; Aaron Stump

doi:10.1007/s10817-006-9026-1

Back

Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)

Journal article

Peer reviewed

Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)

Clark Barrett, Leonardo de Moura and Aaron Stump

Journal of automated reasoning, Vol.35(4), pp.373-390

11/01/2005

DOI: 10.1007/s10817-006-9026-1

View Online

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.

Computer Science

Computer Science, Artificial Intelligence

Science & Technology

Technology

Details

Title: Subtitle: Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
Creators: Clark Barrett - New York University
Leonardo de Moura - SRI International
Aaron Stump - Washington University in St. Louis
Resource Type: Journal article
Publication Details: Journal of automated reasoning, Vol.35(4), pp.373-390
Publisher: Springer Nature
DOI: 10.1007/s10817-006-9026-1
ISSN: 0168-7433
eISSN: 1573-0670
Number of pages: 18
Language: English
Date published: 11/01/2005
Academic Unit: Computer Science
Record Identifier: 9984259472502771

Metrics

1 Record Views

13 Times Cited - Web of Science