J. C. Huang / 2008-05-30 00:00:00
?ยป?This page intentionally left blank
Path-Oriented Program Analysis
This book presents a unique method for decomposing a computer program
along its execution paths, for simplifying the subprograms so
produced, and for recomposing a program from its subprograms. This
method enables us to divide and conquer the complexity involved in
understanding the computation performed by a program by decomposing
it into a set of subprograms and then simplifying them to the furthest
extent possible. The resulting simplified subprograms are generally more
understandable than the original program as a whole. The method may
also be used to simplify a piece of source code by following the pathoriented
method of decomposition, simplification, and recomposition.
The analysis may be carried out in such a way that the derivation of the
analysis result constitutes a correctness proof. Themethod can be applied
to any source code (or portion thereof) that prescribes the computation to
be performed in terms of assignment statements, conditional statements,
and loop constructs, regardless of the language or paradigm used.
J. C. Huang received a Ph.D. in electrical engineering from the University
of Pennsylvania in 1969. He is a Professor Emeritus in the Department
of Computer Science at the University of Houston, where he served as
chair from 1992 to 1996.
Read more
Parts:
1
2
3
4
5
6
7
8
9