Algorithms for reducing redundancy in the path of descriptions obtained by using the Lunts method

For analysis of control structures in a program, the path finding method due to Lunts is particularly useful because manipulation of control structures can be systematically accomplished through matrix operations. The problem with this method is that the path descriptions produced may contain redundant terms, which are undesirable in many applications. In this thesis we describe a number of steps that, when incorporated into the Lunts method, will greatly reduce the redundancy in the resulting path descriptions.