Consider the bit-vector formula ϕ ≡ x ≥ 3 ∧ (x = 0 ∨ y = 4), where x and y are two bit vectors. A lazy SMT solver will abstract ϕ as a Boolean skeleton b1 ...
確定! 回上一頁