Validating one or more circuits using one of more grids

Details Validating one or more circuits using one of more grids Validating one or more circuits using one of more grids

2005-06-28

2009-06-09

Dinh, Paul (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

Reexamination Certificate

active

07546563

ABSTRACT:
In one embodiment, a method for validating one or more circuits using one or more grids includes accessing a circuit and generating one or more seeds for executing one or more instances of validation on the circuit. Each instance of validation comprising one or more tasks. The method also includes distributing the tasks and the seeds across a grid including multiple nodes and, using the seeds, executing the instances of validation at the nodes in the grid according to the tasks.

REFERENCES:
patent: 2004/0093571 (2004-05-01), Jain et al.
patent: 2004/0210860 (2004-10-01), Ganai et al.
patent: 2008/0066032 (2008-03-01), Levitt et al.
Amla et al., “Experimental Analysis of Different Techniques for Bounded Model Checking,” TACAS, vol. 2619 of LNCS, 15 pgs, Apr. 2003.
Asato et al., “Grid Middleware for Effectively Utilizing Computing Resources: CyberGRIP,” Fujitsu Scientific and Technical Journal, vol. 40, pp. 261-268, Dec. 2004.
Biere, et al., “Verifying Safety Properties of a PowerPC™ Microprocessor Using Symbolic Model Checking without BDDs,” CAV, vol. 1633 of LNCS, pp. 60-71, Jul. 1999.
Bjesse et al., “Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers,” CAV, vol. 2102 or LNCS, 12 pgs, Jul. 2001.
Cabodi et al., “Improving SAT-based Bounded Model Checking by Means of BDD-based Approximate Traversals,” In Proc. of the Design Automation and Test in Europe, pp. 6 pgs, Mar. 2003.
Clarke et al., “Bounded Model Checking using Satisfiability Solving,” Formal Methods in System Design, 20 pgs, Jul. 2001.
Copty, et al., “Benefits of Bounded Model Checking at an Industrial Setting,” CAV, 25 pgs, Jul. 2001.
Feldman, et al., “Parallel Multithreaded Satisfiability Solver: Design and Implementation,” PDMC, 15 pgs, 2004.
Ganai et al., “Enhancing Simulation with BDDs and ATPG,” The University of Texas at Austin, 39 pgs, Dec. 1998.
Ganai, et al., “Efficient Distributed SAT and SAT-based Distributed Bounded Model Checking,” CHARME, 15 pgs, 2003.
Garavel et al., “Parallel State Space Construction for Model-Checking,” SPIN workshop on Model checking of software, Springer-Verlag New York, Inc., 22 pgs, 2001.
Grumberg et al., “Distributed Symbolic Model Checking for μ-calculus,” Computer Aided Verification, 13 pgs, 2001.
Gupta et al., “Abstraction and BDDs Complement SAT-Based BMC in DiVer,” Proc. of the 15th Conf. on Computer-Aided Verification, vol. 2725 of LNCS, 4 pgs, Jul. 2003.
Gupta et al., “Learning from BDDs in SAT-based Bounded Model Checking,” Proc. of the 40th Design Automation Conf., pp. 824-829, Jun. 2003.
Hazelhurst et al., “A Hybrid Verification Approach: Getting Deep into the Design,” Proc. of the 39th Design Automation Conf., 6 pgs, Jun. 2002.
Heyman, et al., “Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits,” CAV, 19 pgs, May 30, 2000.
Ho et al., “Smart Simulation Using Collaborative Formal and Simulation Engines,” Proc. of the IEEE/ACM International Conference on Computer-Aided Design, 7 pgs, Nov. 2000.
Iyer et al., “A Fast Sequential SAT Engine for Circuits,” Proc. of the IEEE/ACM International Conference on Computer-Aided Design, 7 pp. 320-325, Nov. 2003.
Jain et al., “On Analysis of Boolean Functions,” Ph.D. Dissertation, Dept. of Electrical and Computer Engineering, The University of Texas at Austin, 176 pgs, May 1993.
Kuehlmann et al., “Robust Boolean Reasoning for Equivalence Checking and Functional Property Verification,” IEEE Trans. on CAD, pp. 1377-1394, Dec. 2002.
Kuehlmann et al., “Probabilistic State Space Search,” Proc. of the IEEE/ACM International Conference on Computer-Aided Design, 6 pgs, Nov. 1999.
Moskewicz et al., “Chaff: Engineering an Efficient SAT Solver,” Proc. of the 38th Design Automation Conf., 6 pgs, Jun. 2001.
Moon et al. “Lease Fixpoint Approximations for Reachability Analysis,” ICCAD, 4 pgs, 1999.
Narayan et al., “Partitioned ROBDDs—A Compact, Canonical and Efficiently Manipulate Representation for Boolean Functions,” ICCAD 8 pgs, 1996.
Sahoo et al., “A Partitioning Methodology for BDD-based Verification,” FMCAD, 15 pgs, 2004.
Stern et al., “Parallelizing the Murphy Verifier,” CAV, 12 pgs, 1997.
Stornetta et al., “Implementation of an Efficient Parallel BDD Package,” DAC, 50 pgs, Dec. 1995.
Yang et al., “Parallel Breadth-First BDD Construction,” In symposium on Principles and practice of parallel programming, ACM Press, 12 pgs, 1997.
Yang et al., “Validation with Guided Search of the State Space,” Proc. of the 39th Design Automation Conf., 6 pgs, Jun. 1998.
Yalagandula et al., “Automatic Lighthouse Generation for Directed State Space Search,” In Proc. of the Design Automation and Test in Europe, pp. 6 pgs, Mar. 2000.

Affiliated with

Also associated with

Rating

Validating one or more circuits using one of more grids does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Validating one or more circuits using one of more grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Validating one or more circuits using one of more grids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4104894