You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

The SMT Competition 2015–2018

Issue title: SAT 2018 Competitions and Evaluations

Guest editors: Martina Seidl and Luca Pulina

Article type: Research Article

Authors: Weber, Tjarka | Conchon, Sylvainb | Déharbe, Davidc | Heizmann, Matthiasd | Niemetz, Ainae | Reger, Gilesf

Affiliations: [a] Uppsala University, Sweden. E-mail: [email protected] | [b] Paris-Sud University, France. E-mail: [email protected] | [c] ClearSy Systems Engineering, France. E-mail: [email protected] | [d] University of Freiburg, Germany. E-mail: [email protected] | [e] Stanford University, USA. E-mail: [email protected] | [f] University of Manchester, UK. E-mail: [email protected]

Keywords: SMT solver, SMT-COMP, SMT-LIB, Satisfiability Modulo Theories, competitions

DOI: 10.3233/SAT190123

Journal: Journal on Satisfiability, Boolean Modeling and Computation, vol. 11, no. 1, pp. 221-259, 2019

Received 1 November 2018
|
Revision received 1 August 2019
|
Published: 1 September 2019
Get PDF open access

Abstract

The International Satisfiability Modulo Theories Competition is an annual competition between Satisfiability Modulo Theories (SMT) solvers. The 2018 edition of the competition was part of the FLoC Olympic Games, which comprised 14 competitions in various areas of computational logic. We report on the design and selected results of the SMT Competition during the last FLoC Olympiad, from 2015 to 2018. These competitions set several new records regarding the number of participants, number of benchmarks used, and amount of computation performed.

Show more