stp
Constraint Solver
STP is an efficient decision procedure for the validity (or satisfiability) of formulas from a quantifier-free many-sorted theory of fixed-width bitvectors and (non-extensional) one-dimensional arrays. The functions in STP's input language include concatenation, extraction, left/right shift, sign-extension, unary minus, addition, multiplication, (signed) modulo/division, bitwise Boolean operations, if-then-else terms, and array reads and writes. The predicates in the language include equality and (signed) comparators between bitvector terms.
Není dostupný žádný oficiální balíček pro openSUSE Leap 16.0Distribuce
openSUSE Tumbleweed
openSUSE Leap 16.0
openSUSE Leap 15.6
openSUSE Leap 15.5
SLFO 1.2
SUSE SLE-15-SP1
Nepodporované distribuce
Následující distribuce nejsou oficiálně podporovány. Použijte tyto balíčky na vlastní nebezpečí.