Queue formal proof based on one-entry FIFO equivalence
ok, I got it to work when adding
#[cfg(test)]
and merging in the latest master. if you want to rebase on master, i can merge this.
Rebased on master. Took the opportunity to fix the issues…
Queue formal proof based on one-entry FIFO equivalence
Can you try it on your end? If I do it, cargo check gives me an error:
error[E0412]: cannot find type `QueueDebugPort` in this scope
--> crates/fayalite/src/util/ready_valid.rs:198:18
…
Queue formal proof based on one-entry FIFO equivalence
The induction proof works! I think my work is complete on this branch.
WIP: Queue formal proof based on one-entry FIFO equivalence
Add module exercising formal verification of memories
Incorrect number of bits for signed range