Computer Science and Engineering, Department of


Date of this Version



Digest of Technical Papers., IEEE International Conference on Computer-Aided Design, 1988. ICCAD-88. doi: 10.1109/ICCAD.1988.122486 Copyright 1988 IEEE. Used by permission.


The performance of a fast fault simulation algorithm for combinational circuits, such as the critical path tracing method, is determined primarily by the efficiency with which it can deduce the detectability of stem faults (stem analysis). We propose a graph based approach to perform stem analysis. A dynamic data structure, called the criticality constraint graph, is used during the backward pass to carry information related to self masking and multiple-path sensitization of stem faults. The structure is updated in such a way that when stems are reached their criticality can be found by looking at the criticality constraints on their fanout branches. Compared to the critical path tracing method, our algorithm is exact and does not require forward propagation of individual stem faults. Several examples are given to illustrate the power of the algorithm. Preliminary data on an implementation is also provided.