Using automatic program decomposition techniques in software maintenance tools

The use of program decomposition to assist maintenance programmers in all three phases of maintenance, namely, comprehension, modification and debugging, is discussed. Visibility flow graphs are introduced to represent the information about the static semantics of a program. Using static analysis of programs, it is possible to approximate their dynamic behavior. More precise analysis is possible if the program is monitored during its execution. For dynamic semantics, dependence relations are used that reflect the dependency of statements on the input value of variables and of the output value of variables on the statements. These relations are generated both at static analysis time and during program execution. Some sample sessions with a prototype program analyzer for a subset of Ada are included.<<ETX>>