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.
Для openSUSE Leap 16.0 відсутній офіційний пакунокДистрибутиви
openSUSE Tumbleweed
openSUSE Leap 16.0
openSUSE Leap 15.6
openSUSE Leap 15.5
home:aaronpuchert:Backports:SLE-15
Спільнота
2.3.4+20240918
SLFO 1.2
SUSE SLE-15-SP1
Непідтримувані дистрибутиви
Наступні дистрибутиви офіційно не підтримуються. Використовуйте ці пакунки на власний ризик.