03205nam 22006255 450 991073578780332120230810225312.03-658-41888-510.1007/978-3-658-41888-5(MiAaPQ)EBC30661932(Au-PeEL)EBL30661932(DE-He213)978-3-658-41888-5(PPN)272252808(CKB)27757819200041(EXLCZ)992775781920004120230722d2023 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierPolynomial Formal Verification of Approximate Functions /by Martha Schnieber1st ed. 2023.Wiesbaden :Springer Fachmedien Wiesbaden :Imprint: Springer Vieweg,2023.1 online resource (87 pages)BestMasters,2625-3615Print version: Schnieber, Martha Polynomial Formal Verification of Approximate Functions Wiesbaden : Springer Fachmedien Wiesbaden GmbH,c2023 9783658418878 Introduction -- Preliminaries -- RelatedWork -- PolynomialVerification -- Experiments -- Conclusion.During 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.BestMasters,2625-3615Electronic circuitsElectronic circuit designAlgebraMathematicsData processingElectronic Circuits and SystemsElectronics Design and VerificationAlgebraComputational Mathematics and Numerical AnalysisElectronic circuits.Electronic circuit design.Algebra.MathematicsData processing.Electronic Circuits and Systems.Electronics Design and Verification.Algebra.Computational Mathematics and Numerical Analysis.512.942Schnieber Martha1379155MiAaPQMiAaPQMiAaPQBOOK9910735787803321Polynomial Formal Verification of Approximate Functions3418595UNINA