Abstract
This paper describes a new program for the hierarchical comparison of two netlists. The program differs from other ne(list comparison programs in that it does a true hierarchical comparison on the maximal overlap in the two hierarchies. It abes not require the hierarchies on the two netlists to be isomorphic. Built in heuristics are used to correct many commonly found errors. The program runsfmt (takes about 8 minutes on a Sun4175 to compare 3 million transistor chip) and has been used to compare layout vs schematic netlists for 2 chips with over 2 million devices each.

This publication has 3 references indexed in Scilit: