Polynomial Formal Verification of Approximate Functions

저자
정보 없음
출판사
Springer Nature B.V.
출판일
20230723
ISBN
9783658418892
ISBN 등록 지역
독일어권 (ISBN 978-3)

소개

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.