@oe1cxw On page 17 of your slides: http://www.clifford.at/papers/2016/yosys-smtbmc/slides.pdf … The naive one-shot will prove asserts hold for ALL states within N steps of init?
-
-
On page 18, you say "induction length must be at least 5". These states aren't reachable from init, but you mention it's possible >>
-
to start in them anyway. Why is "induction length >= 5" sufficient if I can find even one path N < 5 where the solver reaches >>
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.