Efficient computation of dominators in multiple-output circuit graphs

We present an efficient technique for computing dominators in multiple-output circuit graphs. Dominators provide information about the origin and the end of reconverging paths in a graph. This information is widely used in CAD applications such as satisfiability checking, equivalence checking, ATPG, technology mapping, decomposition of Boolean functions and power optimization. Experiments on a large set of benchmarks show a significant performance improvement of our new technique in comparison to the well-known algorithm, presented by T. Lengauer and R.E. Tarjan (1979), for computing dominators in flowgraphs. We demonstrate that, in contrast to previous techniques, our algorithm obtains performance improvements especially for large benchmarks.