|
|||||
|
|
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005) |
|
| Authors: | Clark?Barrett Leonardo?de?Moura |
| Affiliation: | (1) Department of Computer Science, New York University, New York, NY, USA;(2) Computer Science Laboratory, SRI International, Menlo Park, CA, USA;(3) Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA |
| 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. |
| Keywords: | competition decision procedures satisfiability modulo theories |
| 本文献已被 SpringerLink 等数据库收录！ | |