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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 373-390 |
| Number of pages | 18 |
| Journal | Journal of Automated Reasoning |
| Volume | 35 |
| Issue number | 4 |
| DOIs | |
| State | Published - Nov 1 2005 |
Keywords
- Competition
- Decision procedures
- Satisfiability modulo theories
ASJC Scopus subject areas
- Software
- Computational Theory and Mathematics
- Artificial Intelligence
Fingerprint Dive into the research topics of 'Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)'. Together they form a unique fingerprint.
Cite this
Barrett, C., De Moura, L., & Stump, A. (2005). Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005). Journal of Automated Reasoning, 35(4), 373-390. https://doi.org/10.1007/s10817-006-9026-1