Arithmetic Bit-level Verification using Network Flow Model - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Arithmetic Bit-level Verification using Network Flow Model

Maciej Ciesielski
  • Function : Author
  • PersonId : 918025
André Rossi

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.

Domains

Electronics
No file

Dates and versions

hal-00871863 , version 1 (10-10-2013)

Identifiers

Cite

Maciej Ciesielski, Walter Brown, André Rossi. Arithmetic Bit-level Verification using Network Flow Model. Ninth Haifa Verification Conference, 2013, Haifa, Israel. pp.327-343, ⟨10.1007/978-3-319-03077-722⟩. ⟨hal-00871863⟩
73 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More