Key points are not available for this paper at this time.
Program graphs have been used as a vehicle to focus attention on the structure of a program. A systematic methodology for partitioning a program graph (digraph) to highlight the relationships between program elements is introduced along with an attendant notation. This notation is described in purely mathematical terms in the first section, and then the programming-related implications of this approach are addressed in the second section.
Michael Paige (Mon,) studied this question.