Circuit verification using multiple engines

Details Circuit verification using multiple engines Circuit verification using multiple engines

2007-10-09

2007-10-09

Chiang, Jack (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C716S030000

Reexamination Certificate

active

10996706

ABSTRACT:
In one embodiment, a method for circuit verification using multiple engines includes running multiple traces on a circuit using multiple reachability algorithms, selecting an effective reachability algorithm for the circuit from among the multiple reachability algorithms according to a comparison of results of the multiple traces with each other, generating a set of initial states for the selected effective reachability algorithm using states reached in the plurality of traces, and executing the selected effective reachability algorithm using the generated set of initial states to verify the circuit.

REFERENCES:
patent: 6026222 (2000-02-01), Gupta et al.
patent: 6421808 (2002-07-01), McGeer et al.
patent: 6816825 (2004-11-01), Ashar et al.
patent: 7028279 (2006-04-01), Jain et al.
patent: 7065726 (2006-06-01), Singhal et al.
Biere et al., “Symbolic Model Checking without BDDs,” Lecture Notes in Computer Science, 1579:193-207, 18 pages, Jan. 4, 1999.
Bloem et al., “Symbolic Guided Search for CTL Model Checking,” In DAC, 6 pages, 2000.
Boppana et al., “Model Checking Based on Sequential ATPG. In ICCAD,” pp. 418-430. Springer-Verlag, 11th International Conference, Jul. 6-10, 1999.
Bryant, “Graph-based Algorithms for Boolean Function Manipulation,” IEEE Transactions Computers, C-35-8, 677-691, 29 pages, 1986.
Clarke et al., “Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic,” In Proc. IBM Workshop on Logics of Programs, vol. 131 of LNCS, pp. 52-71, Springer-Verlag, 1981.
Coudert et al. “Verification of Sequential Machines Based on Symbolic Execution,” In Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, 1989.
Garavel et al., “Parallel State Space Construction for Model-Checking,” In SPIN workshop on model checking of software, pp. 217-234. Springer-Verlag New York, Inc., 2001.
Heyman et al., “Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits,” In CAV, 19 pages, May 30, 2000.
Jain, “On Analysis of Boolean Functions,” Ph.D Dissertation, Dept. of Electrical and Computer Engineering, The University of Texas at Austin, 1993.
McMillan, “Symbolic Model Checking,” Kluwer Academic Publishers, 1993.
Narayan et al., “Reachability Analysis Using Partitioned-ROBDDs,” In Proc. of the Intl. Conf. on Computer-Aided Design, pp. 388-393, 1997.
Stern et al., “Parallelizing the Murphy Verifier,” In CAV, pp. 1-12, 1997.
Stornetta et al., Implementation of an Efficient Parallel BDD Package,: In DAC, pp. 641-644, 50 pages, 1996.
Yang et al., “Parallel Breadth-First BDD Construction,” In symposium on Principles and practice of parallel programming, pp. 145-156. ACM Press, 12 pages, 1997.
Cabodi et al., “Symbolic Exploration of Large Circuits with Enhanced Forward/Backward Traversals,” In EuroDAC, 6 pages, 1994.
Cabodi et al., “Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification,” In CAV, pp. 471-484, 2002.
Chauhan et. al., “Non-Linear Quantification Scheduling in Image Computation,” In ICCAD, 6 pages, 2001.
Clarke et al., “Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic,” vol. 131 of LNCS, unknown.
Govindaraju et al., “Verification by Approximate Forward and Backward Reachability,” In ICCAD, 5 pages, 1998.
Iyer et al., “Improved Symbolic Verification Using Partitioning Techniques,” In Proc. of CHAR ME, vol. 2860 of Lecture Notes in Computer Science, pp. 411-424, 2003.
Jain et al., “Functional Partitioning for Verification and Related Problems,” Brown/MIT VLSI Conference, 1992, [II] K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
Moon et al., “To Split or to Conjoin: The Question in Image Computation,” In DAC, 6 pages, 2000.
Somenzi., “UDD: CU Decision Diagram Package,” ftp://vlsi.colorado.edulpub, 2001.
VIS. Verilog Benchmarks http://vlsi.colorado.edul- vis/, unknown.
Wang et al., The Compositional Far Side of Image Computation. In ICCAD, 2003.

Affiliated with

Also associated with

Rating

Circuit verification using multiple engines does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Circuit verification using multiple engines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuit verification using multiple engines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3822878