LEADER 03196nam  22006135  450 
001 9910735787803321
005 20230810225312.0
010   $a3-658-41888-5
024 7 $a10.1007/978-3-658-41888-5
035   $a(MiAaPQ)EBC30661932
035   $a(Au-PeEL)EBL30661932
035   $a(DE-He213)978-3-658-41888-5
035   $a(PPN)272252808
035   $a(EXLCZ)9927757819200041
100   $a20230722d2023      u|             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aPolynomial Formal Verification of Approximate Functions$b[electronic resource] /$fby Martha Schnieber
205   $a1st ed. 2023.
210  1$aWiesbaden :$cSpringer Fachmedien Wiesbaden :$cImprint: Springer Vieweg,$d2023.
215   $a1 online resource (87 pages)
225 1 $aBestMasters,$x2625-3615
311 08$aPrint version: Schnieber, Martha Polynomial Formal Verification of Approximate Functions Wiesbaden : Springer Fachmedien Wiesbaden GmbH,c2023 9783658418878 
327   $aIntroduction -- Preliminaries -- RelatedWork -- PolynomialVerification -- Experiments -- Conclusion.
330   $aDuring the development of digital circuits, their functional correctness has to be ensured, for which formal verification methods have been established. However, the verification process using formal methods can have an exponential time or space complexity, causing the verification to fail. While exponential in general, recently it has been proven that the verification complexity of several circuits is polynomially bounded. Martha Schnieber proves the polynomial verifiability of several approximate circuits, which are beneficial in error-tolerant applications, where the circuit approximates the exact function in some cases, while having a lower delay or being more area-efficient. Here, upper bounds for the BDD size and the time and space complexity are provided for the verification of general approximate functions and several state-of-the-art approximate adders. About the author Martha Schnieber is working as a research assistant in the Group of Computer Architecture at the University of Bremen.
410  0$aBestMasters,$x2625-3615
606   $aElectronic circuits
606   $aElectronic circuit design
606   $aAlgebra
606   $aMathematics$xData processing
606   $aElectronic Circuits and Systems
606   $aElectronics Design and Verification
606   $aAlgebra
606   $aComputational Mathematics and Numerical Analysis
615  0$aElectronic circuits.
615  0$aElectronic circuit design.
615  0$aAlgebra.
615  0$aMathematics$xData processing.
615 14$aElectronic Circuits and Systems.
615 24$aElectronics Design and Verification.
615 24$aAlgebra.
615 24$aComputational Mathematics and Numerical Analysis.
676   $a512.942
700   $aSchnieber$b Martha$01379155
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910735787803321
996   $aPolynomial Formal Verification of Approximate Functions$93418595
997   $aUNINA