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

Authors:
Clark Barrett;Leonardo Moura;Aaron Stump
Affiliations:
Department of Computer Science, New York University, New York, USA;Computer Science Laboratory, SRI International, Menlo Park, USA;Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, USA
Venue:
Journal of Automated Reasoning
Year:
2005

Citing 0
Cited 6

Proving Resource Consumption of Low-level Programs Using Automated Theorem Provers

Electronic Notes in Theoretical Computer Science (ENTCS)
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)

Formal Methods in System Design
A theory-based decision heuristic for DPLL(T)

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Satisfiability modulo theories: introduction and applications

Communications of the ACM
Theory instantiation

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.02

Visualization

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.