Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Embedding Sequential Circuits for their Polynomial Formal Verification
Angielski
212 b
Nawet do 30 dni na zwrot
Klienci kupili także
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Miękka
134.52
zł
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?