US5559718A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for model-based verification of local design rules
Assignee: Cadence Design Systems Inc
•
Filing: 1994-04-28
•
Granted: 1996-09-24
•
Expires: 2014-04-28
Abstract
Abstract A system for model-based verification of local design rules comprises a processing unit, a verification database wherein a cell reference graph representing an integrated circuit design as a hierarchical collection of cells is stored, a verification function memory wherein a verification function is stored, a friendly worklayer memory, and an unfriendly worklayer memory. Each cell can include shape models and references to lower-level cells. The processing unit first verifies each cell in the cell reference graph that does not reference any lower-level cells, after which the processing unit verifies each cell for which all lower-level cells referenced have been previously verified. During the verification of a selected cell, the processing unit determines whether models in the selected cell interact with other models in the selected cell or with any lower-level cell. Interacting models are referred to as being "unfriendly," and non-interacting models are referred to as being "friendly." The processing unit references a previously calculated verification result when models are friendly, and applies a verification function to models that are unfriendly. A method for model-based verification of local design rules comprises the steps of: selecting a cell for verification; selecting a verification function; determining whether models in the cell reference graph are unfriendly with a model in the selected cell; applying the selected verification function to each model involved in an unfriendly interaction; and generating an override in the event that a previously calculated verification result is invalid due to unfriendliness between models.
Inventors
- 👤 Allen Baisuck
- 👤 Richard L. Fairbank
- 👤 Walter K. Gowen, III
- 👤 Jon R. Henriksen
- 👤 William W. Hoover, III
- 👤 Judith A. Huckabay
- 👤 Eric Rogoyski
- 👤 Anton G. Salecker
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 03:30
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/398
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
335 words
A system for model-based verification of local design rules in a physical integrated circuit design, the system comprising: a processing unit having an input and an output, for performing the model-based local design rule verification of the physical integrated circuit design according to a sequence of program instruction steps; a verification database having an input and an output, for storing a cell reference graph representing the physical integrated circuit design as a set of cells, each cell representing one of a constituent model and a shape model on a physical mask design, each constituent model comprising a reference to one of a shape model and a reference to a second cell at a lower hierarchical level, the output of the verification database coupled to the input of the processing unit, the input of the verification database coupled to the output of the processing unit, said verification database further comprising: a reference graph register having an input and an output, for storing the cell reference graph representation of the physical integrated circuit design, the output of the reference graph register coupled to the input of the processing unit, the input of the reference graph register coupled to the output of the processing unit; a results register having an input and an output, for storing a verification result, the input of the results register coupled to the output of the processing unit, and the output of the results register coupled to the input of the processing unit; said processing unit overriding one of said verification results and said results register storing a new verification result associated with a first cell of said set of cells if a position of one of a second cell of said set of cells and a shape model violates said verification function; and a verification memory having an input and an output, for storing said verification function and one or more models during model-based local design rule verification, the output of the verification memory coupled to the input of the processing unit.
Claim 2
Independent Claim
335 words
A system for model-based verification of local design rules in a physical integrated circuit design, the system comprising: a processing unit having an input and an output, for performing the model-based local design rule verification of the physical integrated circuit design according to a sequence of program instruction steps; a verification database having an input and an output, for storing a cell reference graph representing the physical integrated circuit design as a set of cells, each cell representing one of a constituent model and a shape model on a physical mask design, each constituent model comprising a reference to one of a shape model and a reference to a second cell at a lower hierarchical level, the output of the verification database coupled to the input of the processing unit, the input of the verification database coupled to the output of the processing unit, said verification database further comprising: a reference graph register having an input and an output, for storing the cell reference graph representation of the physical integrated circuit design, the output of the reference graph register coupled to the input of the processing unit, the input of the reference graph register coupled to the output of the processing unit; a results register having an input and an output, for storing a verification result, the input of the results register coupled to the output of the processing unit, and the output of the results register coupled to the input of the processing unit; said processing unit overriding one of said verification results and said results register storing a new verification result associated with a first cell of said set of cells if a position of one of a second cell of said set of cells and a shape model violates said verification function; and a verification memory having an input and an output, for storing said verification function and one or more models during model-based local design rule verification, the output of the verification memory coupled to the input of the processing unit.
Claim 3
Dependent Claim
106 words
The system of claim 1, wherein the verification memory comprises: a verification function memory having an input and an output, for storing a verification function, the output of the verification function memory coupled to the input of the processing unit, and the input of the verification function memory coupled to the output of the processing unit; and an unfriendly worklayer memory having an input and an output, for storing two or more unfriendly shape models, the input of the unfriendly worklayer memory coupled to the output of the processing unit, and the output of the unfriendly worklayer memory coupled to the input of the processing unit.
Claim 4
Dependent Claim
63 words
The system of claim 2, further comprising a friendly function memory having an input and an output, for storing a friendly function used to determine whether a set of shape models is friendly, the output of the friendly function memory coupled to the input of the processing unit, the input of the friendly function memory coupled to the output of the processing unit.
Claim 5
Dependent Claim
54 words
The system of claim 2, further comprising a friendly worklayer memory having an input and an output, for storing a friendly shape model, the output of the friendly worklayer memory coupled to the input of the processing unit, and the input of the friendly worklayer memory coupled to the output of the processing unit.
Claim 6
Dependent Claim
63 words
The system of claim 1, further comprising a rain relationship register having an input and an output, for storing a reference to a rain relationship between cells in the cell reference graph, the output of the rain relationship register coupled to the input of the processing unit, and the input of the rain relationship register coupled to the output of the processing unit.
Claim 7
Dependent Claim
296 words
In a system having a processing unit, a verification memory storing a verification function, and a verification database storing a cell reference graph representing a physical integrated circuit design as a hierarchical collection of cells, each cell in the cell reference graph associated with a hierarchical level and comprising one of a reference to a constituent model and a reference to a shape model, each constituent model comprising one from the group of a reference to a shape model and a reference to another cell at a lower hierarchical level, a method for model-based verification of local design rules in the physical integrated circuit design comprising the steps of: selecting a cell for verification; selecting a verification function; identifying each shape model referenced by the selected cell that is unfriendly with another shape model referenced by the selected cell; determining whether the selected cell references a first cell at a lower hierarchical level that is unfriendly with one of said selected cell shape models and a second cell at one of the same hierarchical level or a lower hierarchical level as said first cell; performing a decomposition upon the first cell and the second cell if the selected cell references a first cell at a lower hierarchical level that is unfriendly with a second cell at one of the same hierarchical level and said lower hierarchical level as the first cell; applying said selected verification function to the identified unfriendly shape models to determine a verification result representative of whether a design rule associated with said selected verification function is violated; and storing said verification result in a memory location associated with said selected cell and overriding any previous verification result associated with one of said first cell and said second cell, in said verification memory.
Claim 8
Dependent Claim
296 words
In a system having a processing unit, a verification memory storing a verification function, and a verification database storing a cell reference graph representing a physical integrated circuit design as a hierarchical collection of cells, each cell in the cell reference graph associated with a hierarchical level and comprising one of a reference to a constituent model and a reference to a shape model, each constituent model comprising one from the group of a reference to a shape model and a reference to another cell at a lower hierarchical level, a method for model-based verification of local design rules in the physical integrated circuit design comprising the steps of: selecting a cell for verification; selecting a verification function; identifying each shape model referenced by the selected cell that is unfriendly with another shape model referenced by the selected cell; determining whether the selected cell references a first cell at a lower hierarchical level that is unfriendly with one of said selected cell shape models and a second cell at one of the same hierarchical level or a lower hierarchical level as said first cell; performing a decomposition upon the first cell and the second cell if the selected cell references a first cell at a lower hierarchical level that is unfriendly with a second cell at one of the same hierarchical level and said lower hierarchical level as the first cell; applying said selected verification function to the identified unfriendly shape models to determine a verification result representative of whether a design rule associated with said selected verification function is violated; and storing said verification result in a memory location associated with said selected cell and overriding any previous verification result associated with one of said first cell and said second cell, in said verification memory.
Claim 9
Dependent Claim
32 words
The method of claim 6, further comprising the steps of identifying each shape model referenced by the selected cell that is friendly with each other shape model referenced by the selected cell.
Claim 10
Dependent Claim
22 words
The method of claim 7, further comprising the step of selectively applying the selected verification function to the identified friendly shape models.
Claim 11
Dependent Claim
49 words
The method of claim 7, wherein the decomposition comprises the steps of: selecting a constituent model referenced by the second cell; determining whether a shape model referenced in the first cell maintains a rain relationship with the constituent model; and determining whether the constituent model is a shape model.
Claim 12
Dependent Claim
58 words
The method of claim 9, wherein in the event that the shape model referenced in the first cell does not maintain a rain relationship with the constituent model and the constituent model is a shape model, the method further comprises the step of identifying the constituent model as friendly with the shape model referenced in the first cell.
Claim 13
Dependent Claim
55 words
The method of claim 9, wherein in the event that the shape model referenced in the first cell does not maintain a rain relationship with the constituent model and the constituent model is not a shape model, the method further comprises the step of referencing a previously calculated verification result associated with the constituent model.
Claim 14
Dependent Claim
53 words
The method of claim 9, wherein in the event that the shape model referenced in the first cell maintains a rain relationship with the constituent model and the constituent model is not a shape model, the method further comprises the step of performing a decomposition upon the first cell and the constituent model.
Claim 15
Dependent Claim
52 words
The method of claim 9, wherein in the event that the shape model referenced in the first cell maintains a rain relationship with the constituent model and the constituent model is a shape model, the method further comprises the step of performing a decomposition upon the constituent model and the first cell.
Claim 16
Dependent Claim
39 words
The method of claim 13, wherein the step of performing the decomposition upon the constituent model and the first cell comprises the step of identifying each shape model in the first cell that is unfriendly with the constituent model.
Claim 17
Dependent Claim
66 words
The method of claim 6, further comprising the steps of: determining whether the selected cell references a lower-level cell that is unfriendly with a shape model referenced in the selected cell; and in the event that the selected cell references a lower-level cell that is unfriendly with a shape model referenced in the selected cell, performing a decomposition upon the selected cell and the lower-level cell.
Claim 18
Dependent Claim
48 words
The method of claim 15, wherein the decomposition comprises the steps of: selecting a constituent model referenced by the lower-level cell; determining whether the shape model in the selected cell maintains a rain relationship with the constituent model; and determining whether the constituent model is a shape model.
Claim 19
Dependent Claim
55 words
The method of claim 16, wherein in the event that shape model in the selected cell does not maintain a rain relationship with the constituent model and the constituent model is a shape model, the method further comprises the step of identifying the constituent model as friendly with the shape model in the selected cell.
Claim 20
Dependent Claim
54 words
The method of claim 16, wherein in the event that the shape model in the selected cell does not maintain a rain relationship with the constituent model and the constituent model is not a shape model, the method further comprises the step of referencing a previously calculated verification result associated with the constituent model.
Claim 21
Dependent Claim
56 words
The method of claim 16, wherein in the event that the shape model in the selected cell maintains a rain relationship with the constituent model and the constituent model is not a shape model, the method further comprises the step of performing a decomposition upon the shape model in the selected cell and the constituent model.
Claim 22
Dependent Claim
51 words
The method of claim 16, wherein in the event that the shape model in the selected cell maintains a rain relationship with the constituent model and the constituent model is a shape model, the method further comprises the step of performing a decomposition upon the constituent model and the selected cell.
Claim 23
Dependent Claim
38 words
The method of claim 20, wherein the step of performing the decomposition upon the constituent model and the selected cell comprises the step of identifying each model in the selected cell that is unfriendly with the constituent model.
Claim 24
Dependent Claim
23 words
The system of claim 1, wherein said first cell is one of a sibling cell and a child cell of said second cell.
Claim 25
Dependent Claim
31 words
The system of claim 1, wherein each of said cells comprises one of a reference to another of said cells and a reference to one of a plurality of shape models.
References Cited (Backward Citations)
US4306286A
Cited
US4725975A
Cited
US4635218A
Cited
US4758953A
Cited
US4703435A
Cited
US5050091A
Cited
US4891773A
Cited
US5212650A
Cited
US5126950A
Cited
US4829446A
Cited
US5038294A
Cited
US5067091A
Cited
US5051938A
Cited
US5243538B1
Cited
US5243538A
Cited
US5198986A
Cited
US5202889A
Cited
US5086477A
Cited
US5345401A
Cited
US5313398A
Cited
US5481473A
Cited
US5497334A
Cited
US5440720A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-09-24 | 2000-03-25 | 2000-09-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-09-24 | 2004-03-25 | 2004-09-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-09-24 | 2008-03-25 | 2008-09-24 | $7700.00 | Window Closed / Lapsed |