Scribd
Upload
4 views19 pages

Chapter 17wht

Chapter 17 discusses various software testing techniques aimed at identifying errors before program delivery. It covers concepts such as testability, exhaustive vs selective testing, and different testing methodologies including white-box, basis path, loop, and black-box testing. The chapter emphasizes the importance of structured testing approaches to ensure software quality and performance.

Uploaded by

maria.benedict35
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
4 views19 pages

Chapter 17wht

Chapter 17 discusses various software testing techniques aimed at identifying errors before program delivery. It covers concepts such as testability, exhaustive vs selective testing, and different testing methodologies including white-box, basis path, loop, and black-box testing. The chapter emphasizes the importance of structured testing approaches to ensure software quality and performance.

Uploaded by

maria.benedict35
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

Chapter 17

Software Testing Techniques


Software
Testing
Testing is the process of exercising a
program with the specific intent of finding
errors prior to delivery to the end user.
Testabilit
Operability—it operates cleanly
y of each test case are readily
Observability—the results
observed
Controllability—the degree to which testing can be
automated and optimized
Decomposability—testing can be targeted
Simplicity—reduce complex architecture and logic to
simplify tests
Stability—few changes are requested during testing
Understandability—of the design
What Testing Shows
errors
requirements conformance

performance

an indication
of quality
Who Tests the Software?

developer independent tester


Understands the system Must learn about the system,
but, will test "gently" but, will attempt to break it
and, is driven by "delivery" and, is driven by quality
Exhaustive Testing

loop < 20 X

14
There are 10 possible paths! If we execute one
test per millisecond, it would take 3,170 years to
test this program!!
Selective Testing
Selected path

loop < 20 X
Test Case
Design
"Bugs lurk in corners
and congregate at
boundaries ..."
Boris Beizer

OBJECTIVE to uncover errors

CRITERIA in a complete manner

CONSTRAINT with a minimum of effort and time


White-Box
Testing

... our goal is to ensure that all


statements and conditions have
been executed at least once ...
Why
logic errors Cover?
and incorrect assumptions
are inversely proportional to a path's
execution probability

we often believe that a path is not


likely to be executed; in fact, reality is
often counter intuitive

typographical errors are random; it's


likely that untested paths will contain
some
Basis Path
Testing
First, we compute the cyclomatic
complexity:

number of simple decisions + 1

or

number of enclosed areas + 1

In this case, V(G) = 4


Cyclomatic
A number of industry studies have indicated
or errors.
Complexity
that the higher V(G), the higher the probability

modules

V(G)

modules in this range are


more error prone
Basis Path
Next, we derive the
1
Testing
independent paths:

Since V(G) = 4,
there are four paths
2

Path 1: 1,2,3,6,7,8
4
3
Path 2: 1,2,3,5,7,8
5 6 Path 3: 1,2,4,7,8
Path 4: 1,2,4,7,2,4,...7,8

Finally, we derive test


7 cases to exercise these
paths.
8
Basis Path Testing
Notes
you don't need a flow chart,
but the picture will help when
you trace program paths

count each simple logical test,


compound tests count as 2 or
more

basis path testing should be


applied to critical modules
Loop Testing

Simple
loop
Nested
Loops
Concatenated
Loops Unstructured
Loops
Loop Testing: Simple Loops
Minimum conditions—Simple Loops
1. skip the loop entirely
2. only one pass through the loop
3. two passes through the loop
4. m passes through the loop m < n
5. (n-1), n, and (n+1) passes through
the loop
where n is the maximum number
of allowable passes
Loop Testing: Nested Loops
Nested Loops
Start at the innermost loop. Set all outer loops to their
minimum iteration parameter values.
Test the min+1, typical, max-1 and max for the
innermost loop, while holding the outer loops at their
minimum values.
Move out one loop and set it up as in step 2, holding all
other loops at typical values. Continue this step until
the outermost loop has been tested.
Concatenated Loops
If the loops are independent of one another
then treat each as a simple loop
else* treat as nested loops
endif*
for example, the final loop counter value of loop 1 is
used to initialize loop 2.
Black-Box Testing
requirements

output

input events
Equivalence Partitioning:
Sample Equivalence Classes
Valid data
user supplied commands
responses to system prompts
file names
computational data
physical parameters
bounding values
initiation values
output data formatting
responses to error messages
graphical data (e.g., mouse picks)
Invalid data
data outside
physically bounds ofdata
impossible the program

proper value supplied in wrong place

You might also like