LEADER 03673nam  22006495  450 
001 9910672445403321
005 20230810181107.0
010   $a3-031-24571-7
024 7 $a10.1007/978-3-031-24571-8
035   $a(MiAaPQ)EBC7207245
035   $a(Au-PeEL)EBL7207245
035   $a(CKB)26183423700041
035   $a(DE-He213)978-3-031-24571-8
035   $a(PPN)268210292
035   $a(EXLCZ)9926183423700041
100   $a20230214d2023      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aFormal Verification of Structurally Complex Multipliers /$fby Alireza Mahzoon, Daniel Große, Rolf Drechsler
205   $a1st ed. 2023.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2023.
215   $a1 online resource (xiii, 130 pages) $cillustrations
311 08$aPrint version: Mahzoon, Alireza Formal Verification of Structurally Complex Multipliers Cham : Springer International Publishing AG,c2023 9783031245701 
320   $aIncludes bibliographical references and index.
327   $aIntroduction -- Background -- Challenges of SCA-based Verification -- Local Vanishing Monomials Removal -- Reverse Engineering -- Dynamic Backward Rewriting -- SCA-based Verifier RevSCA-2.0 -- Debugging -- Conclusion and Outlook.
330   $aThis book addresses the challenging tasks of verifying and debugging structurally complex multipliers. In the area of verification, the authors first investigate the challenges of Symbolic Computer Algebra (SCA)-based verification, when it comes to proving the correctness of multipliers. They then describe three techniques to improve and extend SCA: vanishing monomials removal, reverse engineering, and dynamic backward rewriting. This enables readers to verify a wide variety of multipliers, including highly complex and optimized industrial benchmarks. The authors also describe a complete debugging flow, including bug localization and fixing, to find the location of bugs in structurally complex multipliers and make corrections. Provides extensive introduction to the field of Symbolic Computer Algebra (SCA) and its application to multiplier verification; Discusses the challenges of SCA-based verification when it comes to proving the correctness of structurally complex multipliers; Describes three techniques to improve and extend SCA for the verification of structurally complex multipliers; Introduces a complete debugging flow to localize and fix bugs in structurally complex multipliers.
606   $aElectronic circuits
606   $aElectronic circuit design
606   $aComputer science$xMathematics
606   $aEmbedded computer systems
606   $aElectronic Circuits and Systems
606   $aElectronics Design and Verification
606   $aSymbolic and Algebraic Manipulation
606   $aEmbedded Systems
615  0$aElectronic circuits.
615  0$aElectronic circuit design.
615  0$aComputer science$xMathematics.
615  0$aEmbedded computer systems.
615 14$aElectronic Circuits and Systems.
615 24$aElectronics Design and Verification.
615 24$aSymbolic and Algebraic Manipulation.
615 24$aEmbedded Systems.
676   $a512.0285
676   $a515.24330285
700   $aMahzoon$b Alireza$01335368
702   $aGrosse$b Daniel
702   $aDrechsler$b Rolf
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910672445403321
996   $aFormal verification of structurally complex multipliers$93299364
997   $aUNINA