Principles of CMOS VLSI design: a systems perspective
Principles of CMOS VLSI design: a systems perspective
Exclusion constraints: a new application of graph algorithms to VLSI design
Proceedings of the fourth MIT conference on Advanced research in VLSI
A design by example regular structure generator
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
An interpreter for general netlist design rule checking
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
| Hi-index | 0.00 |
The process of verifying that a circuit's schematic netlist obeys a particular design methodology is formalized. Circuit correctness is tied to a rigorous set of context free grammar composition rules. These rules define how a small set of module symbols may be combined for circuits adhering to the design methodology. Schematic netlists are represented as graphs, and composition rules are defined as graph transformations akin to grammatical productions. Starting with a circuit netlist, a hierarchical parse tree that can demonstrate the wellformedness of the circuit is constructed. The procedure is hierarchical, incremental, and fast. GRASP operates one to two orders of magnitude faster than previous approaches.