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...
Главные авторы: | Jain, H, Kroening, D, Sharygina, N, al., E |
---|---|
Формат: | Journal article |
Опубликовано: |
Institute of Electrical and Electronics Engineers
2008
|
Схожие документы
Verifying C++ with STL Containers via Predicate Abstraction
по: Blanc, N, и др.
Опубликовано: (2007)
по: Blanc, N, и др.
Опубликовано: (2007)
Схожие документы
-
Word Level Predicate Abstraction and Refinement for Verifying RTL Verilog
по: Jain, H, и др.
Опубликовано: (2008) -
Word Level Predicate Abstraction and Refinement for Verifying RTL Verilog
по: Jain, H, и др.
Опубликовано: (2005) -
Word level predicate abstraction and refinement for verifying RTL verilog
по: Jain, H, и др.
Опубликовано: (2005) -
Word-Level Predicate-Abstraction and Refinement Techniques for Verifying RTL Verilog.
по: Jain, H, и др.
Опубликовано: (2008) -
Image Computation and Predicate Refinement for RTL Verilog using Word Level Proofs
по: Kroening, D, и др.
Опубликовано: (2007)