Muutke küpsiste eelistusi

E-raamat: Embedding Sequential Circuits for their Polynomial Formal Verification

  • Formaat: EPUB+DRM
  • Sari: BestMasters
  • Ilmumisaeg: 01-Jan-2026
  • Kirjastus: Springer Vieweg
  • Keel: eng
  • ISBN-13: 9783658501556
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 92,01 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Embedding Sequential Circuits for their Polynomial Formal VerificationSuurem pilt
  • Formaat: EPUB+DRM
  • Sari: BestMasters
  • Ilmumisaeg: 01-Jan-2026
  • Kirjastus: Springer Vieweg
  • Keel: eng
  • ISBN-13: 9783658501556
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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 todays 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.
Introduction.- Polynomial Formal Verification.- Preliminaries.-
Verification of Full Counter Circuits.- Verification of Modulo Counter
Circuits.- Experimental Results.- Conclusion.
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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97836585015566e.html