Barry K. Rosen

TL;DR: In this article, the authors present new algorithms that efficiently compute static single assignment forms and control dependence graphs for arbitrary control flow graphs using the concept of {\em dominance frontiers} and give analytical and experimental evidence that these data structures are usually linear in the size of the original program.

TL;DR: This work proposes a redundancy elimination algorithm that is global (in that it deals with the entire program), yet able to recognize redundancy among expressions that are lexitally different, and takes advantage of second order effects.

TL;DR: This paper presents strong evidence that static single assignment form and the control dependence graph can be of practical use in optimization, and presents a new algorithm that efficiently computes these data structures for arbitrary control flow graph.

TL;DR: The authors present a model, called a transition fault, which when used with parallel-pattern, single-fault propagation, is an efficient way to simulate delay faults and shows that delay fault simulation can be done of random patterns in less than 10% more time than needed for a stuck fault simulation.

TL;DR: In this paper, a computer implemented method of underwriting profitability analysis delivers the analytic process to a wide cross-section of insurance decision makers, which leverages an existing investment in databases and improves underwriting business processes.