6 Years of SMT-COMP
6 Years of SMT-COMP
复制标题
DOI：
10.1007/s10817-012-9246-5
复制
发表时间：
2013-03-01
期刊：
影响因子：
--
通讯作者：
Stump, Aaron
中科院分区：
文献类型：
--
作者：
Barrett, Clark;Deters, Morgan;Stump, Aaron
年度可满足性模理论竞赛（SMT-COMP）于2005年发起，旨在促进可满足性模理论（SMT）社区开发的最先进技术和工具的进步。本文总结了前六届比赛的情况。我们介绍了比赛的组织和规则的演变，展示了在比赛过程中最先进的技术是如何改进的，并讨论了SMT-COMP对SMT社区及其他方面的影响。此外，我们还包括一个详尽的所有竞争对手的名单，目前的实验结果表明，在SMT求解器在这六年显着改善。最后，我们分析了在何种程度上的竞争已经实现了最初的目标，并勾画了未来的竞争方向。
The annual Satisfiability Modulo Theories Competition (SMT-COMP) was initiated in 2005 in order to stimulate the advance of state-of-the-art techniques and tools developed by the Satisfiability Modulo Theories (SMT) community. This paper summarizes the first six editions of the competition. We present the evolution of the competition's organization and rules, show how the state of the art has improved over the course of the competition, and discuss the impact SMT-COMP has had on the SMT community and beyond. Additionally, we include an exhaustive list of all competitors, and present experimental results showing significant improvement in SMT solvers during these six years. Finally, we analyze to what extent the initial goals of the competition have been achieved, and sketch future directions for the competition.