Refined formal verification support
- Dominant language
- Haskell
- Stars
- 3.2k
- Forks
- 432
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 5
Description
Improve support for proving difficult properties through hevm. Combine fuzzing and symbolic execution more effectively, start symbolic exploration from states discovered by fuzzing, improve solver scheduling and resource limits, close compatibility gaps between property, Foundry and verification modes, and produce stable counterexamples that can be replayed and minimized.
Related issues and PRs:
- [ ] #1621
- [ ] #1538 / #1537
- [ ] #1510
Optionally:
- [ ] #1409
Contributor guide
Research direction
Start by reviewing hevm support and the related issues and PRs #1621, #1538, #1537, and #1510; optionally review #1409. Define the scope for combining fuzzing with symbolic execution, solver limits, mode compatibility, and replayable minimized counterexamples before implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell, solidity
- Domain
- blockchain, security, testing
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Active
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100