Word-level predicate-abstraction and refinement rechniques for verifying RTL Verilog
As a first step, most model checkers used in the hardware industry convert a high-level register-transfer-level (RTL) design into a netlist. However, algorithms that operate at the netlist level are unable to exploit the structure of the higher abstraction levels and, thus, are less scalable. The RT...
Asıl Yazarlar: | Jain, H, Kroening, D, Sharygina, N, al., E |
---|---|
Materyal Türü: | Journal article |
Baskı/Yayın Bilgisi: |
Institute of Electrical and Electronics Engineers
2008
|
Benzer Materyaller
-
Word Level Predicate Abstraction and Refinement for Verifying RTL Verilog
Yazar:: Jain, H, ve diğerleri
Baskı/Yayın Bilgisi: (2008) -
Word Level Predicate Abstraction and Refinement for Verifying RTL Verilog
Yazar:: Jain, H, ve diğerleri
Baskı/Yayın Bilgisi: (2005) -
Word level predicate abstraction and refinement for verifying RTL verilog
Yazar:: Jain, H, ve diğerleri
Baskı/Yayın Bilgisi: (2005) -
Word-Level Predicate-Abstraction and Refinement Techniques for Verifying RTL Verilog.
Yazar:: Jain, H, ve diğerleri
Baskı/Yayın Bilgisi: (2008) -
Image Computation and Predicate Refinement for RTL Verilog using Word Level Proofs
Yazar:: Kroening, D, ve diğerleri
Baskı/Yayın Bilgisi: (2007)