Polynomial Formal Verification of Approximate Functions

DOI10.1007/978-3-658-41888-5MaRDI QIDQ6060794zbMATH OpenOpenAlexFDO

Authors

Publication date 6 November 2023

Published in BestMasters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-658-41888-5

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Networks and circuits as models of computation; circuit complexity (68Q06) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• A BDD-based verification method for large synthesized circuits
• Formal verification of n-bit ALU using theorem proving
• Formal Verification of Structurally Complex Multipliers
• Formal Verification of Transcendental Fixed- and Floating-point Algorithms using an Automatic Theorem Prover
• Functional verification of high performance adders in \textsc{Coq}

Cited in

(3)

• Formally verified approximations of definite integrals
• Polynomial function intervals for floating-point software verification
• Formal verification of Medina's sequence of polynomials for approximating arctangent

This page was built for publication: Polynomial Formal Verification of Approximate Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060794)