The authors present an algorithm for detecting untestable paths in mul
ti-level circuits. By constructing equivalent normal form (ENF) for re
convergent paths only, the proposed algorithm detects and removes unte
stable paths efficiently in terms of runtime and memory usage.