We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
It would be nice to have some static static integer and array bounds checking using some sort of refinement-style thing.
I asked, and granule seems to have some of it in its codebase:
this module deals with compiling our internal theorems into SMT theorems for Z3 to use: https://github.com/granule-project/granule/blob/master/frontend/src/Language/Granule/Checker/Constraints.hs https://github.com/granule-project/granule/tree/master/frontend/src/Language/Granule/Checker/Constraints there’s a lot of stuff about doing symbolic representations the code is in need of some TLC though
this module deals with compiling our internal theorems into SMT theorems for Z3 to use:
there’s a lot of stuff about doing symbolic representations the code is in need of some TLC though
The text was updated successfully, but these errors were encountered:
Z3 or CVC4 might be helpful for this.
Sorry, something went wrong.
This looks nifty - checks the witnesses that are returned from SMT solvers: https://github.com/smtcoq/smtcoq (via this twitter thread).
No branches or pull requests
It would be nice to have some static static integer and array bounds checking using some sort of refinement-style thing.
I asked, and granule seems to have some of it in its codebase:
The text was updated successfully, but these errors were encountered: