000			nam a22 7a 4500
999			_c29553 _d29553
008			190626b xxu||||| |||| 00| 0 eng d
020			_a9783319955124 _c(hbk)
082			_a004.0151 _bRUS
100			_aRussinoff, David M.
245			_aFormal verification of floating-point hardware design : a mathematical approach
260			_aSwitzerland : _bSpringer, _c2019
300			_axxiv, 382 p. : _bill. ; _c24 cm.
365			_b84.99 _cEUR _d00
504			_aIncludes bibliographical references and index.
520			_aThis is the first book to focus on the problem of ensuring the correctness of floating-point hardware designs through mathematical methods. Formal Verification of Floating-Point Hardware Design advances a verification methodology based on a unified theory of register-transfer logic and floating-point arithmetic that has been developed and applied to the formal verification of commercial floating-point units over the course of more than two decades, during which the author was employed by several major microprocessor design companies. The book consists of five parts, the first two of which present a rigorous exposition of the general theory based on the first principles of arithmetic. Part I covers bit vectors and the bit manipulation primitives, integer and fixed-point encodings, and bit-wise logical operations. Part II addresses the properties of floating-point numbers, the formats in which they are encoded as bit vectors, and the various modes of floating-point rounding. In Part III, the theory is extended to the analysis of several algorithms and optimization techniques that are commonly used in commercial implementations of elementary arithmetic operations. As a basis for the formal verification of such implementations, Part IV contains high-level specifications of correctness of the basic arithmetic instructions of several major industry-standard floating-point architectures, including all details pertaining to the handling of exceptional conditions. Part V illustrates the methodology, applying the preceding theory to the comprehensive verification of a state-of-the-art commercial floating-point unit. All of these results have been formalized in the logic of the ACL2 theorem prover and mechanically checked to ensure their correctness. They are presented here, however, in simple conventional mathematical notation. The book presupposes no familiarity with ACL2, logic design, or any mathematics beyond basic high school algebra. It will be of interest to verification engineers as well as arithmetic circuit designers who appreciate the value of a rigorous approach to their art, and is suitable as a graduate text in computer arithmetic.
650			_aData Processing
650			_aInformation technology
650			_aMachine theory
650			_aComputer architecture
650			_aSystems analysis &​ design
650			_aCircuits &​ components
650			_aSoftware engineering
942			_2ddc _cBK