Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

More precise bitwise AND #24

Closed
elazarg opened this issue Sep 16, 2018 · 1 comment
Closed

More precise bitwise AND #24

elazarg opened this issue Sep 16, 2018 · 1 comment
Labels
question

Comments

@elazarg
Copy link

elazarg commented Sep 16, 2018

x & K can at least be inferred to be <= K. This is not the case currently.
@caballa
Copy link
Contributor

caballa commented Nov 23, 2018 •
edited
Loading

I'm assuming you mean that y = x & k implies that y <= k

E.g., given x = 10, k = -3 and bitwdith=4 we get y = 1010 & 1101 = 1000

which in decimal, y = 8. Thus, we cannot infer here that y <= -3

@caballa caballa closed this as completed Dec 4, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
question
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@caballa @elazarg