Embedding Sequential Circuits for their Polynomial Formal Verification



de

Éditeur :

Springer Vieweg


Paru le : 2026-01-01



eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
89,66

Téléchargement immédiat
Dès validation de votre commande
Ajouter à ma liste d'envies
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

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.
Pages
74 pages
Collection
n.c
Parution
2026-01-01
Marque
Springer Vieweg
EAN papier
9783658501549
EAN PDF
9783658501556

Informations sur l'ebook
Nombre pages copiables
0
Nombre pages imprimables
7
Taille du fichier
7557 Ko
Prix
89,66 €
EAN EPUB
9783658501556

Informations sur l'ebook
Nombre pages copiables
0
Nombre pages imprimables
7
Taille du fichier
16558 Ko
Prix
89,66 €

Caroline Dominik is a doctoral researcher at the Group of Computer Architecture (AGRA) at the University of Bremen, with a research focus on self-explaining cyber-physical systems. She completed her Master's degree in Computer Science in December 2024.

Suggestions personnalisées