runtimeverification / runtimeverification/haskell-backend
Add "hard" integration test for Booster's SMT solver interface
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 224
- Forks
- 43
- PR merge metrics
- No merged PRs in 30d
Description
While working on a PR implementing syntactic filtering of side conditions, I've noticed that the SMT solver gets harder conditions in some KEVM proofs.
We need to extract these conditions, likely the jump conditions, from the mcd/flopper-tick-pass-rough-spec.k proof and use them as an intergrations test for booster-dev.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the mcd/flopper-tick-pass-rough-spec.k proof and identify the harder conditions, likely its jump conditions. Use those conditions to define an integration test for booster-dev, then run the test and verify that the Booster SMT solver interface handles them successfully.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- testing-qa
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100