On Live-Dead Analysis for Global Data Flow Problems

Abstract

Algorithms to determine the hve variables of a program for global data flow problems usually apply the logical bit-vector operations This paper shows the pitfalls of the bit-vector approach. It demonstrates that while an algorithm using only O (logan) bit-vector operations could be designed, where n is the number of basic blocks in the program, a simple algorithm using linear list as the basic data structure is more desirable from a practical point of view