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

dc.creatorChang, Fang-Hui Lee
dc.description.abstractFor 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.
dc.description.departmentMathematics, Department of
dc.format.digitalOriginreformatted digital
dc.rightsThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. §107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.
dc.titleAlgorithms for reducing redundancy in the path of descriptions obtained by using the Lunts method
dc.type.genreThesis of Natural Sciences and Mathematics, Department of of Houston of Science


Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
1.5 MB
Adobe Portable Document Format