Author:
Konrad Alexander,Scholl Christoph,Mahzoon Alireza,Große Daniel,Drechsler Rolf
Abstract
AbstractRecent methods based on Symbolic Computer Algebra (SCA) have shown great success in formal verification of multipliers and—more recently—of dividers as well. In this paper we enhance known approaches by the computation of satisfiability don’t cares for so-called Extended Atomic Blocks (EABs) and by Delayed Don’t Care Optimization (DDCO) for optimizing polynomials during backward rewriting. Using those novel methods we are able to extend the applicability of SCA-based methods to further divider architectures which could not be handled by previous approaches. We successfully apply the approach to the fully automatic formal verification of large dividers (with bit widths up to 512).
Funder
German Research Foundation
LIT Secure and Correct Systems Lab
Albert-Ludwigs-Universität Freiburg im Breisgau
Publisher
Springer Science and Business Media LLC
Reference50 articles.
1. Balyo T, Heule M, Iser M et al (eds) (2023) Proceedings of SAT competition 2023: Solver, Benchmark and Proof Checker Descriptions. Department of Computer Science Series of Publications B, Department of Computer Science, University of Helsinki, Finland
2. Berkeley Logic Synthesis and Verification Group (2019) ABC: a system for sequential synthesis and verification. available at https://people.eecs.berkeley.edu/alanmi/abc/
3. Brayton RK, Mishchenko A (2010) ABC: an academic industrial-strength verification tool. In: Computer Aided Verification. Springer, pp 24–40
4. Bryant RE (1986) Graph-based algorithms for Boolean function manipulation. IEEE Trans Comp 35(8):677–691
5. Bryant RE (1996) Bit-level analysis of an SRT divider circuit. In: Design Automation Conf., pp 661–665