Abstract. The paper presents a new approach to functional, bit-level verification of arithmetic circuits. The circuit is modeled as a network of adders and basic Boolean gates, and the computation performed by the circuit is viewed as a flow of binary data through such a network. The verification problem is cast as a Network Flow problem and solved using symbolic term rewriting and simple algebraic techniques. Functional correctness is proved by showing that the symbolic flow computed at the primary inputs is equal to the flow computed at the primary outputs. Experimental results show a potential application of the method to certain classes of arithmetic circuits.
In REF the same problem is solved by modeling the computation of an arithmetic function as a flow of binary data, and representing it as algebraic expression.
Arithmetic Bit-Level Verification Using Network Flow Model
Haifa Verification Conference
Computer Science