Adaptive bug-search depth for simple and deep counterexamples

US10210296B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10210296-B2
Application numberUS-201715791620-A
CountryUS
Kind codeB2
Filing dateOct 24, 2017
Priority dateMar 21, 2017
Publication dateFeb 19, 2019
Grant dateFeb 19, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Aspects of the present invention include methods, systems and computer program products. The method includes a processor providing a netlist indicative of connectivity and functional states of components of an integrated circuit design; iteratively searching through the netlist at a selected depth to locate errors within the netlist by a plurality of trials, each of the plurality of trials having a plurality of iterations; adaptively adjusting the selected depth depending on any errors within the netlist being located, the selected depth increasing over time from an initial value as between the plurality of iterations; and adaptively adjusting an amount of coverage of the netlist depending on any errors within the netlist being located, the amount of coverage of the netlist decreasing over time from an initial amount as between the plurality of iterations.

First claim

Opening claim text (preview).

What is claimed is: 1. A computer-implemented method of designing an integrated circuit comprising: providing, by a processor, a netlist indicative of connectivity and functional states of components of an integrated circuit design; iteratively searching, by the processor, through the netlist at a selected depth to locate errors within the netlist by a plurality of trials, each of the plurality of trials having a plurality of iterations, wherein iteratively searching, by the processor, through the netlist at a selected depth to locate errors within the netlist comprises performing a simulation process and a symbolic analysis process; adaptively adjusting, by the processor, the selected depth depending on any errors within the netlist being located, the selected depth increasing over time from an initial value as between the plurality of iterations; adaptively adjusting, by the processor, an amount of coverage of the netlist depending on any errors within the netlist being located, the amount of coverage of the netlist decreasing over time from an initial amount as between the plurality of iterations; and manufacturing the integrated circuit design. 2. The computer-implemented method of claim 1 wherein the selected depth of the netlist comprises a number of simulation cycles by which iteratively searching by the processor is performed. 3. The computer-implemented method of claim 1 wherein an amount of coverage of the netlist is determined by at least one of analysis of the functional states of the components of the integrated circuit design and of analysis of secondary properties of the components of the integrated circuit design. 4. The computer-implemented method of claim 1 further comprising determining, by the processor, a depth of the netlist depending on a length of a trace associated with a gate component of the integrated circuit design, and shortening, by the processor, the length of the trace, wherein the trace comprises a sequence of valuations of the gate component of the integrated circuit design. 5. The computer-implemented method of claim 4 further comprising shortening, by the processor, the length of the trace starting from a first state of the gate component that is later in time than a second state of the gate component. 6. The computer-implemented method of claim 1 wherein the processor is located in a cloud computing environment, and wherein the method is implemented in software run by the processor located in the cloud computing environment.

Assignees

Inventors

Classifications

  • using formal methods, e.g. equivalence checking or property checking · CPC title

  • CAD in a network environment, e.g. collaborative CAD or distributed simulation · CPC title

  • Routing (G06F30/396 takes precedence) · CPC title

  • G06F17/504Primary

    Physics · mapped topic

  • Physics · mapped topic

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10210296B2 cover?
Aspects of the present invention include methods, systems and computer program products. The method includes a processor providing a netlist indicative of connectivity and functional states of components of an integrated circuit design; iteratively searching through the netlist at a selected depth to locate errors within the netlist by a plurality of trials, each of the plurality of trials havi…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F30/3323. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Feb 19 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).