The fundamental difference is
in the way a program is organized, i.e., in the way an execution path
is divided up and incorporated in different parts of the program. The
sequence of steps to be taken to compute a function is the same. The
algorithm used, not the way the program is organized, determines the
sequence.
Example A.4 in Appendix is constructed to demonstrate this point.
C++programmers should also be able to see the applicability in Example
11
Path-Oriented Program Analysis
A.3 aswell. Although Program A.3 is written as a function of a procedureoriented
program, the same code can be used mutatis mutandis as a
member function of a class in an object-oriented program. The present
method can be applied to analyze that piece of code equally well, either
as a ???function??? or as a ???method??? in the program.
It should be reiterated here that the present method is designed to
explicate the computation prescribed in terms of assignment statements,
conditional statements, and loop constructs. To apply the method, the
user must be able to find relevant execution paths in the code to be analyzed,
either manually or through the use of a software tool. This ability
is always tacitly assumed. The task, however, may be made more complex
by multithreading, call-backs, virtual method calls, reflection, and
other features of a modern distributed object-oriented software system,
discussion of which is beyond the scope of this work.
Pages:
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33