Placeholder text

Go to cart

Embedding Sequential Circuits for their Polynomial Formal Verification

By Caroline Dominik

Embedding Sequential Circuits for their Polynomial Formal Verification

By Caroline Dominik

0 - Default Title
Description
As digital circuits are at the core of most of our everyday technologies, society heavily relies on their precise and predictable behavior. However, this demand for correctness often clashes with the speed of today’s design workflows. Whereas a design can be proven to be free of errors based on formal methods, the required time and memory resources of this can often not be predicted. This conflict is addressed by Polynomial Formal Verification (PFV): By selecting adequate data structures and verification techniques, polynomial resource bounds can be proven for the entire procedure so that an efficient verification is guaranteed.
This book adds to this field by applying PFV to circuits with storage elements, also known as sequential circuits. Counter circuits are verified using a polynomial number of steps, even though they have an exponential sequential depth. This is addressed from a theoretical and from a practical point of view.
Product details
Binding:
Paperback
Number of Pages:
92
Release Date:
2026-01-03
Publication Date:
2026-01-03
Publisher:
Springer Vieweg
Languages:
Original: English
ISBN10:
3658501545
ISBN13:
9783658501549
GPSR Manufacturer Reference:
[email protected]
Weight:
132 g
Height:
148 cm
Width:
210 cm
Thickness:
6 cm
Buy on Amazon
Currently sold out