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

Boolector 2.0

Issue title: SAT 2014 Competitions and Evaluations

Subtitle: System description

Article type: Research Article

Authors: Niemetz, Aina | Preiner, Mathias | Biere, Armin

Affiliations: Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria. E-mails: [email protected], [email protected], [email protected]

Keywords: SMT solving, Lemmas on Demand, Lambdas, Don’t Care Reasoning

DOI: 10.3233/SAT190101

Journal: Journal on Satisfiability, Boolean Modeling and Computation, vol. 9, no. 1, pp. 53-58, 2014

Received 1 November 2014
|
Revision received 1 March 2015
|
Published: 1 June 2015
Get PDF open access

Abstract

In this paper, we discuss the most important changes and new features introduced with version 2.0 of our SMT solver Boolector, which placed first in the QF_BV and QF_ABV tracks of the SMT competition 2014. We further outline some features and techniques that were not yet described in the context of Boolector.

Show more