Zobrazeno 1 - 10
of 370
pro vyhledávání: '"Boolector"'
This paper serves as solver description for our SMT solver Boolector as entered into the SMT Competition 2018. We only list important differences to the version of Boolector that entered the SMT Competition 2017
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa06fd06b0b40680990c9264a9191c33
https://epub.jku.at/doi/10.35011/fmvtr.2018-1
https://epub.jku.at/doi/10.35011/fmvtr.2018-1
This paper serves as solver descrip tion for our SMT solver Boolector as entered into the SMT Competition 2017. We only list important differences to the version of Boolector that entered the SMT Competition 2016.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6556e6c17a000133a5e9ea5d2a8b94c8
This paper serves as solver description for our SMT solver Boolector, entering the SMT Competition 2016 in two different configurations. We only list important differences to earlier version of Boolector in the SMT Competition 2015.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1b5c4118b3ce6769669e7312afe4b57
https://epub.jku.at/doi/10.35011/fmvtr.2016-1
https://epub.jku.at/doi/10.35011/fmvtr.2016-1
This paper serves as solver description for our SMT solver Boolector entering the SMT Competition 2014 in three different configurations. We only list important differences to the earlier version of Boolector that participated in the SMT Competition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db7f98ef872c5bd8fd472392768b0e65
https://epub.jku.at/doi/10.35011/fmvtr.2014-1
https://epub.jku.at/doi/10.35011/fmvtr.2014-1
Publikováno v:
Journal on Satisfiability, Boolean Modeling and Computation. 9:53-58
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 techniq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fa026f5662d3a514f99564772a68550
https://doi.org/10.3233/sat190101
https://doi.org/10.3233/sat190101
Autor:
Biere, Armin
This note serves as machine description for Boolector entering the SMT Competition 2012. Boolector has been originally developed by Robert Brummayer and Armin Biere at the FMV institute. Since 2009 is maintained and extended by Armin Biere.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b07784966dd79da902093fd756f3f85e
https://epub.jku.at/doi/10.35011/fmvtr.2012-1
https://epub.jku.at/doi/10.35011/fmvtr.2012-1
Publikováno v:
Journal on Satisfiability, Boolean Modeling and Computation; June 2015, Vol. 9 Issue: 1 p53-58, 6p
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Biere, Armin
This note serves as system description of our SMT solver Boolector submitted to the SMT Competition 2011.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9eafbc724a1f88da9ed3086d6457a320
https://epub.jku.at/doi/10.35011/fmvtr.2011-3
https://epub.jku.at/doi/10.35011/fmvtr.2011-3
Autor:
Robert Brummayer, Armin Biere
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783642007675
TACAS
TACAS
Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination of first-order theories. We present the architecture and selected features of Boolector, which is an efficient SMT solver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f94367c9f5e761fe6adc596a69b8f6a0
https://doi.org/10.1007/978-3-642-00768-2_16
https://doi.org/10.1007/978-3-642-00768-2_16