Incremental, assertion-based design verification

Details Incremental, assertion-based design verification Incremental, assertion-based design verification

2006-08-15

2006-08-15

Kik, Phallaka (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C716S030000, C716S030000, C716S030000, C703S016000

Reexamination Certificate

active

07093218

ABSTRACT:
A design verification system includes a first verification engine to model the operation of a first design of an integrated circuit to obtain verification results including the model's adherence to a property during N time steps of its operation, proofs that one or more verification targets can be reached, and verification coverage results for targets that are not reached. A correspondence engine determines the functional correspondence between the first design and a second design of the integrated circuit. Functional correspondence, if demonstrated, enables reuse of the first engine's verification results to reduce resources expended during subsequent analysis of the second design. The correspondence determination may be simplified using a composite model of the integrated circuit having “implies” logic in lieu of “EXOR” logic. The implies logic indicates conditions in which a node in the second design achieves a state that is contrary to the verification results for the first design.

REFERENCES:
patent: 5461574 (1995-10-01), Matsunaga et al.
patent: 5909374 (1999-06-01), Matsunaga
patent: 6321363 (2001-11-01), Huang et al.
patent: 6408424 (2002-06-01), Mukherjee et al.
patent: 6470480 (2002-10-01), Ganesan et al.
patent: 6480988 (2002-11-01), Ganesan et al.
patent: 6493852 (2002-12-01), Narain et al.
patent: 6532573 (2003-03-01), Kurosaka
patent: 6539523 (2003-03-01), Narain et al.
patent: 6571375 (2003-05-01), Narain et al.
patent: 6581026 (2003-06-01), Lohse et al.
patent: 6611947 (2003-08-01), Higgins et al.
patent: 6625786 (2003-09-01), Ganesan et al.
patent: 6629297 (2003-09-01), Ganesan et al.
patent: 6651228 (2003-11-01), Narain et al.
patent: 6691287 (2004-02-01), Ganesan et al.
patent: 6912700 (2005-06-01), Franco et al.
patent: 6993734 (2006-01-01), Baumgartner et al.
patent: 7028278 (2006-04-01), Jain
patent: 7032192 (2006-04-01), Prasad et al.
patent: 2002/0065640 (2002-05-01), Ramsey
patent: 2002/0112217 (2002-08-01), Ganesan et al.
patent: 2002/0116689 (2002-08-01), Ganesan et al.
patent: 2002/0116693 (2002-08-01), Ganesan et al.
patent: 2002/0120907 (2002-08-01), Ganesan et al.
patent: 2002/0133791 (2002-09-01), Cohn et al.
patent: 2002/0152060 (2002-10-01), Tseng
patent: 2003/0041308 (2003-02-01), Ganesan et al.
patent: 2003/0115564 (2003-06-01), Chang et al.
patent: 2003/0182641 (2003-09-01), Yang
patent: 2004/0015799 (2004-01-01), Jain
patent: 2004/0098683 (2004-05-01), Maruyama et al.
patent: 2004/0117746 (2004-06-01), Narain et al.
patent: 2004/0177332 (2004-09-01), Pandey et al.
patent: 2004/0230923 (2004-11-01), Wilcox et al.
patent: 2004/0237057 (2004-11-01), Prasad et al.
patent: 2005/0010880 (2005-01-01), Schubert et al.
patent: 2005/0102647 (2005-05-01), Tsuchiya
patent: 2005/0171747 (2005-08-01), Franco et al.
Kwak et al., “Combinational Equivalence Checking Through Function Transformation”, IEEE/ACM International Conference on Computer Aided Design, Nov. 10, 2002, pp. 526-533.
NN77112500, “Structured Sequential Machine Comparison”, IBM Technical Disclosure Bulletin, vol. 20, No. 6, Nov. 1997, pp. 2500-2507 (11 pages).

Affiliated with

Also associated with

Rating

Incremental, assertion-based design verification does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Incremental, assertion-based design verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental, assertion-based design verification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3647917