We present linear-time algorithms for the classic problem of finding dominators in a
flowgraph, and for several other problems whose solutions require evaluating a function …

The computation of dominators in a flowgraph has applications in several areas, including
program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [] …

Fault equivalence is an essential concept in digital design with significance in fault
diagnosis, diagnostic test generation, testability analysis and logic synthesis. In this paper …

The problem of finding dominators in a directed graph has many important applications,
notably in global optimization of computer code. Although linear and near-linear-time …

It is now generally accepted that the stuck-at fault model is no longer sufficient for many
manufacturing test activities. Consequently, diagnostic test pattern generation based solely …

How does one verify that the output of a complicated program is correct? One can formally
prove that the program is correct, but this may be beyond the power of existing methods …

We discuss fault equivalence and dominance relations for multiple output combinational
circuits. The conventional definition for equivalence says that" two faults are equivalent if …

In this paper we present an efficient reachability oracle under single-edge or single-vertex
failures for planar directed graphs. Specifically, we show that a planar digraph G can be …

We present a linear-time algorithm that given a flowgraph G=(V, A, r) and a tree T, checks
whether T is the dominator tree of G. Also we prove that there exist two spanning trees of G …

The computation of dominators in a flowgraph has applications in program optimization,
circuit testing, and other areas. Lengauer and Tarjan [17] proposed two versions of a fast …