We present a polynomial time randomized algorithm for … [to detect equivalent expressions]. Our algorithm is complete when conditionals are treated as non-deterministic … deterministic algorithm for the same problem. … [It] is simpler to implement than the deterministic … We prove that [the probability of false equivalence] can be made arbitrarily … Our algorithm is based on the idea of … relationships from the computed values. The computations are … conditional are executed. At join points, the program …
Copyright clearance needed for quotation.