A new approach to perform circuit verification using O(n) algorithms

The paper presents an approach to perform circuit verification, particularly design rule checking (DRC) and circuit extraction, using a very fast data structure, which supports O(n) algorithms. A hierarchical DRC using such a data structure is described by using an object oriented programming methodology. The paper discusses the main problems involved in geometric verification and presents a suitable language to describe the design rules. The paper also discusses the main algorithms employed to implement the DRC and analyses their applicability to circuit extraction. Finally, the hierarchical operation of the DRC is addressed.<>