Case Study of ATPG-based Bounded Model Checking: Verifying USB2.0 IP Core

Authors:
Qiang Qiang;Qiang, Chia-Lun Chang;Daniel G. Saab;Jacob A. Abraham
Affiliations:
Electrical Engineering and Computer Science, Case Western Reserve University Cleveland, Ohio, USA;Electrical Engineering and Computer Science, Case Western Reserve University Cleveland, Ohio, USA;Electrical Engineering and Computer Science, Case Western Reserve University Cleveland, Ohio, USA;Computer Engineering Research CenterThe University of Texas at Austin Austin, TX, USA
Venue:
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Year:
2005

Citing 6
Cited 1

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
An Analysis of ATPG and SAT algorithms for Formal Verification

HLDVT '01 Proceedings of the Sixth IEEE International High-Level Design Validation and Test Workshop (HLDVT'01)
Formal Verification Using Bounded Model Checking: SAT versus Sequential ATPG Engines

VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Verifying Properties Using Sequential ATPG

ITC '02 Proceedings of the 2002 IEEE International Test Conference
Testing of Digital Systems

Testing of Digital Systems
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits

IEEE Transactions on Computers

Reducing verification overhead with RTL slicing

Proceedings of the 17th ACM Great Lakes symposium on VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the ATPG performances of verifying USB2.0 IP core. Using the USB protocol and typical properties, the ATPG-based bounded model checking mechanism is revealed. Heuristics to accelerate the ATPG search are presented and their impacts are analyzed. We feel that results from this case study are applicable to serial communication circuits of the same family and can be scaled to industrial-sized circuits.