Contatto
Come acquistare
Consegna
Guida all'acquisto
Embedding Sequential Circuits for their Polynomial Formal Verification
Inglese
223 b
Fino a 30 giorni per il reso
I clienti hanno acquistato anche
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.
Informazioni sul libro
Inglese
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
32.59
€
/
In brossura
20.69
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?