AMulet 2.0 for Verifying Multiplier Circuits-Reference-Cited by-同舟云学术

AMulet 2.0 for Verifying Multiplier Circuits

Published:2021 Issue: Volume: Page:357-364
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Kaufmann Daniela^ORCID,Biere Armin^ORCID

Abstract

AbstractAMulet 2.0 is a fully automatic tool for the verification of integer multipliers using computer algebra. Our tool models multiplier circuits given as and-inverter graphs as a set of polynomials and applies preprocessing techniques based on elimination theory of Gröbner bases. Finally it uses a polynomial reduction algorithm to verify the correctness of the given circuit. AMulet 2.0 is a re-factorization and improved re-implementation of our previous multiplier verification tool AMulet 1.0.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-72013-1_19

Reference29 articles.

1. P. Beame, R. Impagliazzo, J. Krajícek, T. Pitassi, and P. Pudlák. Lower Bounds on Hilbert’s Nullstellensatz and Propositional Proofs. In Proc. London Math. Society, volume s3-73, pages 1–26, 1996.

2. T. Becker, V. Weispfenning, and H. Kredel. Gröbner Bases, volume 141 of Graduate texts in mathematics. Springer, 1993.

3. A. Biere. Collection of Combinational Arithmetic Miters Submitted to the SAT Competition 2016. In SAT Competition 2016, volume B-2016-1 of Dep. of Computer Science Report Series B, pages 65–66. University of Helsinki, 2016.

4. A. Biere, K. Fazekas, M. Fleury, and M. Heisinger. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions, volume B-2020-1 of Dep. of Computer Science Report Series B, pages 51–53. University of Helsinki, 2020.

5. A. Biere, K. Heljanko, and S. Wieringa. AIGER 1.9 And Beyond. Technical report, FMV Reports Series, JKU Linz, Austria, 2011.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. VeSCMul: Verified Implementation of S-C-Rewriting for Multiplier Verification;Lecture Notes in Computer Science;2024

2. Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams;2023 46th MIPRO ICT and Electronics Convention (MIPRO);2023-05-22

3. Logic Synthesis from Polynomials with Coefficients in the Field of Rationals;2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL);2023-05

4. Formal Verification of Integer Multiplier Circuits Using Binary Decision Diagrams;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-04

5. Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra;International Journal on Software Tools for Technology Transfer;2023-01-11