Abstract
Hardware Assurance (HA) is imperative to ensure the integrity of Integrated Circuits (ICs) after manufacturing. To verify the integrity of an IC would require the extraction of relevant functional block of interest through circuit partitioning. This is usually done by converting a recovered circuit netlist into a circuit graph and subsequently performing unsupervised clustering on the graph. However, circuit graphs are difficult to cluster due to the existence of inherent hierarchies and clusters of imbalanced sizes. In this paper, we propose a novel hierarchical Graph Neural Network (GNN), termed as GraphClusNet, to perform circuit graph clustering in a multi-stage process to achieve near-optimal results. We analytically derive a normalized-cut-based loss function, which allows for clusters of imbalanced sizes. We train our GraphClusNet in a multi-stage hierarchical fashion to regularize intermediate node embedding, which greatly alleviates the over-smoothing effect in deep GNNs. We further propose a multi-scale location-based node feature and feature concatenation to provide a good initialization to stabilize the training of our GNN. Based on the experiments of synthetic graphs, we show that our proposed GraphClusNet obtained solutions with n-cut values up to $\mathbf {65\times }$ closer to the global optimum. On FPGA circuit graphs, our proposed GraphClusNet outperformed the reported methods with up to 30% improvement in Normalized Mutual Information for circuit graph clustering. Impact Statement— The security of Integrated Circuits (ICs) is of paramount importance in data sensitive industries. Hardware Assurance (HA) through circuit analysis ensures the highest level of confidence in manufactured ICs to function as intended and are free of known vulnerabilities. The success of HA relies critically on circuit partitioning to accurately segment the IC into smaller functional blocks for design verification. Existing methods have lower accuracy of $\sim$56% in partitioning circuits with complex structures. Our proposed method leverages on the latest development of artificial intelligence (AI) on graph and improves the accuracy to $>$90% through graph machine learning. This improvement ensures a highly accurate partition of IC which largely increases the success rate of HA. To the best of our knowledge, our proposed method is the first AI method to partition circuit. It opens new possibility of using AI for security of IC.

This publication has 31 references indexed in Scilit: