Back to Search
Start Over
Understanding Algebraic Rewriting for Arithmetic Circuit Verification: A Bit-Flow Model.
- Source :
- IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems; Jun2020, Vol. 39 Issue 6, p1346-1357, 12p
- Publication Year :
- 2020
-
Abstract
- This paper addresses theoretical aspects of arithmetic circuit verification based on algebraic rewriting. Its goal is to advance the understanding of algebraic techniques for arithmetic circuit verification in the context of symbolic computer algebra. The paper offers a new insight into the arithmetic circuit verification problem, by viewing the computation performed by the circuit as the flow of digital data. In the proposed bit-flow model, the circuit is modeled as a network of logic components satisfying a bit-flow conservation law. We prove that the value of the flow of data in the circuit is invariant throughout the circuit and use this to prove soundness and completeness of the rewriting technique, independently from the computer algebra arguments. The efficiency of the method is illustrated with impressive results for large integer multipliers. The verification system and benchmarks are offered in an open source software environment. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02780070
- Volume :
- 39
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems
- Publication Type :
- Academic Journal
- Accession number :
- 143457108
- Full Text :
- https://doi.org/10.1109/TCAD.2019.2912944