Carte Embedding Sequential Circuits for their Polynomial Formal Verification Caroline Dominik

Embedding Sequential Circuits for their Polynomial Formal Verification

Limbă: engleză
Legare: Carte broșată
Disponibilitate: În depozitul extern în cantități mici
Expediem în 9-15 zile
559.25 lei
As digital circuits are at the core of most of our everyday technologies, society heavily relies on...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
2025
Pagini
74
EAN
9783658501549
ISBN
3658501545
Enbook ID
49825285
Greutate
132
Dimensiuni
148 x 210

Descriere completă

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.

S-ar putea să te intereseze

Elizabeth and Marilyn

Julie Owen Moylan
76.90 lei
133.92 lei
42.89 lei
221.53 lei
220.73 lei
237.68 lei
223.25 lei
47.33 lei
184.49 lei

Red Ibis

Walt Dozier
146.44 lei

Clienții care au cumpărat această carte au mai cumpărat și

108.19 lei
148.36 lei