[Libre-soc-bugs] [Bug 565] Improve formal verification on PartitionedSignal

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=565

--- Comment #14 from Cesar Strauss <cestrauss at gmail.com> ---
(In reply to Jacob Lifshay from comment #13)
> A recursive function to create legal partitions:

Thanks. 32-bit is only 5 valid combinations, and 64-bit is still only 26. I
think it can be done simply by enumerating them into a lookup-table, indexed by
a random value.

(In reply to Cesar Strauss from comment #8)
> * Make the prover generic, avoiding repetition on the next proofs

I factored out the gate pattern generator, this should simplify proofs.

> * Implement proofs of the remaining partitioned operations

This is next. I'll begin with PartitionedEq.

-- 
You are receiving this mail because:
You are on the CC list for the bug.