Affiliation:
1. Johannes Kepler University Linz , Institute for Formal Models and Verification , Linz , Austria
Abstract
Abstract
Digital circuits are widely utilized in computers, because they provide models for various digital components and arithmetic operations. Arithmetic circuits are a subclass of digital circuits that are used to execute Boolean algebra. To avoid problems like the infamous Pentium FDIV bug, it is critical to ensure that arithmetic circuits are correct. Formal verification can be used to determine the correctness of a circuit with respect to a certain specification. However, arithmetic circuits, particularly integer multipliers, represent a challenge to current verification methodologies and, in reality, still necessitate a significant amount of manual labor. In my dissertation we examine and develop automated reasoning approaches based on computer algebra, where the word-level specification, modeled as a polynomial, is reduced by a Gröbner basis inferred by the gate-level representation of the circuit. We provide a precise formalization of this reasoning process, which includes soundness and completeness arguments and adds to the mathematical background in this field. On the practical side we present an unique incremental column-wise verification algorithm and preprocessing approaches based on variable elimination that simplify the inferred Gröbner basis. Furthermore, we provide an algebraic proof calculus in this thesis that allows obtaining certificates as a by-product of circuit verification in order to boost confidence in the outcomes of automated reasoning tools. These certificates can be efficiently verified with independent proof checking tools.
Reference30 articles.
1. Barrett, C., Fontaine, P. & Tinelli, C. The Satisfiability Modulo Theories Library (SMT-LIB). (www.SMT-LIB.org, 2016).
2. Biere, A. Collection of Combinational Arithmetic Miters Submitted to the SAT Competition 2016. SAT Competition 2016. B-2016-1 pp. 65–66 (2016).
3. Buchberger, B. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. (University of Innsbruck, 1965).
4. Beame, P., and Liew, V. Towards Verifying Nonlinear Integer Arithmetic. CAV 2017. 10427 pp. 238–258 (2017).
5. Bryant, R. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput. 35, 677–691 (1986).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献