A region analysis algorithm for the live variables problem
An algorithm to solve the ''live variables'' problem on reducible flow graphs is presented. It is based on the concept of a region of a flow graph. The algorithm is compared for time complexity with the well-known round-robin version of the iterative algorithm on ''self-replicating'' families of reducible flow graphs. The results of comparison are inconclusive in that the region analysis algorithm requires fewer bit- vector operations on some graphs and more on others.
scientific article; zbMATH DE number 3872699