A region analysis algorithm for the live variables problem

From MaRDI portal





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.











This page was built for publication: A region analysis algorithm for the live variables problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799117)