Download Path-Oriented Program Analysis by J. C. Huang PDF

By J. C. Huang

This publication offers a different procedure for decomposing a working laptop or computer application alongside its execution paths, for simplifying the subprograms so produced, and for recomposing a software from its subprograms. this system permits us to divide and triumph over the complexity all for realizing the computation played via a application by means of decomposing it right into a set of subprograms after which simplifying them to the furthest quantity attainable. The ensuing simplified subprograms are regularly extra comprehensible than the unique application as an entire. the tactic can also be used to simplify a section of resource code via following the path-oriented approach to decomposition, simplication, and recomposition. The research could be conducted in this type of method that the derivation of the research consequence constitutes a correctness evidence. the tactic should be utilized to any resource code (or component thereof) that prescribes the computation to be played by way of project statements, conditional statements, and loop constructs, whatever the language or paradigm used.

Show description

Read or Download Path-Oriented Program Analysis PDF

Best software development books

Software Ecosystems: Understanding an Indispensable Technology and Industry

This article explains, from various views, how software program and the software program are assorted from different industries technologically, organizationally, and socially.

Using Aspect-Oriented Programming for Trustworthy Software Development

Methods to effectively enforce reliable computing projects utilizing aspect-oriented programming This landmark book fills a niche within the literature by means of not just describing the fundamental options of reliable computing (TWC) and aspect-oriented programming (AOP), but in addition exploring their severe interrelationships.

Event Processing in Action

Opher and Peter,

Just bought my replica of occasion Processing in motion and browse it notwithstanding the weekend.
I could say that you just and Peter produced a real magnum opus. it really is nice!

It can be learn by:
A) each seller that's constructing an EDA/CEP to promote; and
B) each software program engineer who's constructing an EDA/CEP software.

Your booklet is the development processing advisor for a few years to return.
Thank you and congratulations!

Magento Search Engine Optimization

Magento is a feature-rich, specialist, open resource e-commerce program that gives retailers entire flexibility and regulate over the glance, content material, and performance in their on-line shop. you could have the main appealing Magento shop on the web with the main aggressive costs, yet with out viewers, you are going to fight to make major revenues.

Extra resources for Path-Oriented Program Analysis

Example text

Cn are n constraints such that C1 ∨ C2 ∨ . . ∨ Cn ≡ T then P ⇔ / \C1 ∨ C2 ∨ . . ∨ Cn ;P ⇔ {/ \C1 ;P, / \C2 ;P, . . , / \Cn ;P}. The last corollary serves as the basis for decomposing a program into an equivalent set of subprograms. To distinguish this process from the traditional method of decomposing a program into procedures and functions, the present method is called pathwise decomposition because the program is divided along the control flow, whereas in the traditional method of decomposing a program into procedures and functions, a program is divided across the control flow.

Cn ;P}. The last corollary serves as the basis for decomposing a program into an equivalent set of subprograms. To distinguish this process from the traditional method of decomposing a program into procedures and functions, the present method is called pathwise decomposition because the program is divided along the control flow, whereas in the traditional method of decomposing a program into procedures and functions, a program is divided across the control flow. The concept of pathwise decomposition is discussed in more detail in the next chapter.

6.. 6 /\B; while B do S ⇔ /\B; repeat S until ¬B. Because ”while B do S” is not logically equivalent to ”repeat S until ¬B” in general, this shows that /\C; S1 ⇔ /\C; S2 does not imply S1 ⇔ S2 in general. Examples of how the corollaries just given can be used to create or to simplify subprograms in C++ can be found in Appendix A. A state constraint not only directly constrains the program state at the point where it is placed, but also indirectly at other points upstream and downstream in control flow as well.

Download PDF sample

Rated 4.48 of 5 – based on 27 votes