package bitwuzla
SMT solver for QF_AUFBVFP
Install
Authors
Maintainers
Sources
bitwuzla-0.0.1.tbz
sha256=2c486dbb38240297ddf18b118c5df552acf748630e0d63f6e12ce96f6ad42645
sha512=7cd047a5d64444077381222d8c3190689b6b6160ed2fa2520eafc3e1ed267cfb9b2aa4580ae5b6b3d1294aa55fa08a76c2098adff51098beb4535a37c6175dc4
Description
OCaml binding for the SMT solver Bitwuzla.
Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions and their combinations. Its name is derived from an Austrian dialect expression that can be translated as “someone who tinkers with bits”.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page