Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in
Toggle navigation
Menu
Open sidebar
Martin Jonáš
DTEDI
Commits
73f0f181
Commit
73f0f181
authored
Sep 05, 2016
by
Martin Jonas
Browse files
Blbej přetok
parent
4787b821
Changes
1
Hide whitespace changes
Inline
Side-by-side
Chapters/Chapter01.tex
View file @
73f0f181
...
...
@@ -38,8 +38,8 @@ quantifier-free bit-vector formulas eagerly or lazily translate the
formula to the propositional logic (
\emph
{
bit-blasting
}
) and use an
efficient
\sat
solver to decide its satisfiability. Therefore, the
efficiency of most of the bit-vector
\smt
solvers is tightly connected
to the efficiency of the
\sat
solvers. Plenty of solvers
supporting
the
quantifier-free bit-vector formulas exist: Beaver~
\cite
{
Beaver
}
,
to the efficiency of the
\sat
solvers. Plenty of solvers
for the
quantifier-free bit-vector formulas exist: Beaver~
\cite
{
Beaver
}
,
Boolector~
\cite
{
Boolector
}
, CVC4~
\cite
{
CVC4
}
, MathSAT5~
\cite
{
MathSAT
}
,
OpenSMT~
\cite
{
OpenSMT
}
, Sonolar~
\cite
{
Sonolar
}
, Spear~
\cite
{
Spear
}
,
STP~
\cite
{
STP
}
, UCLID~
\cite
{
LS04
}
, Yices~
\cite
{
Yices
}
, and
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment