Verification is an essential step of the hardware design lifecycle. Usually verification is done at the gate level (Boolean level). We present verilog2smv, a tool that generates word-level model checking problems from Verilog designs augmented with assertions. A key aspect of our tool is that memories in the designs are treated without any form of abstraction. verilog2smv can be used for RTL verification by chaining with a word-level model checker like NUXMV. To this extent, we present also some experimental results over Verilog verification benchmarks, using verilog2smv+NUXMV as a tool-chain.
Verilog2SMV: A tool for word-level verification / Irfan, Ahmed; Cimatti, Alessandro; Griggio, Alberto; Roveri, Marco; Sebastiani, Roberto. - STAMPA. - (2016), pp. 1156-1159. (Intervento presentato al convegno 19th Design, Automation and Test in Europe Conference and Exhibition, DATE 2016 tenutosi a Dresden nel 14th-18th March 2016) [10.3850/9783981537079_0765].
Verilog2SMV: A tool for word-level verification
Irfan, Ahmed;Cimatti, Alessandro;Griggio, Alberto;Roveri, Marco;Sebastiani, Roberto
2016-01-01
Abstract
Verification is an essential step of the hardware design lifecycle. Usually verification is done at the gate level (Boolean level). We present verilog2smv, a tool that generates word-level model checking problems from Verilog designs augmented with assertions. A key aspect of our tool is that memories in the designs are treated without any form of abstraction. verilog2smv can be used for RTL verification by chaining with a word-level model checker like NUXMV. To this extent, we present also some experimental results over Verilog verification benchmarks, using verilog2smv+NUXMV as a tool-chain.File | Dimensione | Formato | |
---|---|---|---|
verilog2smv-proceeding-version.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
230.51 kB
Formato
Adobe PDF
|
230.51 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione