Presents and explains a method to simplify a piece of source code by following the path-oriented method of decomposition, simplification, and recomposition.
Presents and explains a method to simplify a piece of source code by following the path-oriented method of decomposition, simplification, and recomposition.
J. C. Huang received a Ph.D. in Electrical Engineering from the University of Pennsylvania in 1969. He is a Professor in the Department of Computer Science at the University of Houston, where he served as Chair from 1992 to 1996. His practical experience in computer software includes serving as the chief architect of a software validation and verification system developed for the U.S. Army's Ballistic Missile Defense Command, and as a senior consultant to the U.S. Naval Underwater Systems Center on submarine software problems.
Inhaltsangabe
1. Introduction 2. State constraints 3. Subprogram simplification 4. Program set 5. Pathwise decomposition 6. Tautological constraints 7. Program recomposition 8. Discussion 9. Automatic generation of symbolic traces Appendix.
