Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Path-Oriented Program Analysis, PDF eBook

Path-Oriented Program Analysis PDF

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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 path-oriented 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.

The method 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.

Information

Information