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.

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

Explicit representation for repeated bit-vectors #1193

Open
bclement-ocp opened this issue Aug 1, 2024 · 0 comments
Open

Explicit representation for repeated bit-vectors #1193

bclement-ocp opened this issue Aug 1, 2024 · 0 comments
Assignees
Milestone

Comments

@bclement-ocp
Copy link
Collaborator

In #1192 we add support for the Sign_extend and Repeat symbols, avoiding to build many unnecessary intermediate terms that clutter the union-find. However there are still performance issues, in particular with sign-extensions to (very) large bit-widths because we are still representing the resulting bit-vector as an explicit concatenation at the semantic value level. In particular, this adds a large constant factor to any solving involving such values.

We should consider representing repetitions explicitly in bit-vector semantic values. Since we need semantic values to be canonical, it might be too expensive/complicated to handle arbitrary repetitions, but we can at least handle repetitions of single bits, which would be enough for the sign_extend case.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant