Get the latest tech news
Echidna Enters a New Era of Symbolic Execution
A blog post describing the new symbolic execution capabilities of Echidna include preliminary results and immediate future
As you probably know, formal verification is rarely completely bulletproof: there are a number of shortcomings and limitations that need to be taken into consideration coming either from theory (e.g. keccak256 hashes are hard to invert) and practice (e.g. SMT solvers can get stuck). We also wanted to highlight that trying to verify code with an unbounded loop, including any function that takes dynamic data structures as inputs (e.g. bytes) is not recommended given the current state of tooling. This code was developed after a discussion started by@GalloDaSballo, who asked whether symbolic execution could be used to extract simple input constraints that prevent reverts, thereby speeding up fuzzing campaigns (similar to what pyrometer computes).
Or read this on Hacker News
