You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Basically, it says that the 2 least-significant bits of 4 * x should be zero. This kind of goal should be simplified away during symbolic simulation, and should not show up as a saw-script proof goal.
The text was updated successfully, but these errors were encountered:
…tors.
Truncating a WeightedSum of bitvectors now truncates all the integer
coefficients in the weighted sum, removing those that reduce to 0.
This is useful for simplifying e.g. alignment constraints.
FixesGaloisInc/saw-script#586.
…tors.
Truncating a WeightedSum of bitvectors now truncates all the integer
coefficients in the weighted sum, removing those that reduce to 0.
This is useful for simplifying e.g. alignment constraints.
FixesGaloisInc/saw-script#586.
Here's an example of a proof goal arising from an alignment constraint:
Basically, it says that the 2 least-significant bits of
4 * x
should be zero. This kind of goal should be simplified away during symbolic simulation, and should not show up as a saw-script proof goal.The text was updated successfully, but these errors were encountered: