5. Testing Techniques
undefined
Foundation Level
5
.
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
d
W
h
a
t
i
s
t
e
s
t
i
n
g
?
“
T
e
s
t
i
n
g
i
s
t
h
e
p
r
o
c
e
s
s
o
f
d
e
m
o
n
s
t
r
a
t
i
n
g
t
h
a
t
e
r
r
o
r
s
a
r
e
n
o
t
p
r
e
s
e
n
t
.
”
“
T
h
e
p
u
r
p
o
s
e
o
f
t
e
s
t
i
n
g
i
s
t
o
s
h
o
w
t
h
a
t
a
p
r
o
g
r
a
m
p
e
r
f
o
r
m
s
i
t
s
i
n
t
e
n
d
e
d
f
u
n
c
t
i
o
n
s
c
o
r
r
e
c
t
l
y
.
”
“
T
e
s
t
i
n
g
i
s
t
h
e
p
r
o
c
e
s
s
o
f
e
s
t
a
b
l
i
s
h
i
n
g
c
o
n
f
i
d
e
n
c
e
t
h
a
t
a
s
y
s
t
e
m
d
o
e
s
w
h
a
t
i
t
i
s
s
u
p
p
o
s
e
d
t
o
d
o
.
”
“
T
e
s
t
i
n
g
i
s
t
h
e
p
r
o
c
e
s
s
o
f
f
i
n
d
i
n
g
e
r
r
o
r
s
.
”
W
h
y
d
o
w
e
n
e
e
d
a
t
e
c
h
n
i
q
u
e
?
A
t
e
s
t
t
e
c
h
n
i
q
u
e
/
t
e
s
t
s
t
r
a
t
e
g
y
i
s
u
s
e
d
t
o
g
e
n
e
r
a
t
e
t
e
s
t
s
A
n
e
f
f
e
c
t
i
v
e
t
e
c
h
n
i
q
u
e
f
i
n
d
s
b
u
g
s
T
e
s
t
i
n
g
t
e
c
h
n
i
q
u
e
s
a
r
e
b
a
s
e
d
o
n
r
e
q
u
i
r
e
m
e
n
t
s
4
E
x
a
m
p
l
e
:
C
a
r
i
n
t
e
r
i
o
r
l
i
g
h
t
i
n
g
s
y
s
t
e
m
C
u
s
t
o
m
e
r
r
e
q
u
i
r
e
m
e
n
t
s
By opening the door of the car, the interior light should be turned on
If the door stays open, the light keeps lightening for half an hour
If the door is closed, the interior light will stay on another 15 seconds and
then it should fade out in 3 seconds
L
i
s
t
o
f
r
e
q
u
i
r
e
m
e
n
t
s
:
5
E
x
a
m
p
l
e
:
C
a
r
i
n
t
e
r
i
o
r
l
i
g
h
t
i
n
g
s
y
s
t
e
m
A
u
t
o
m
o
t
i
v
e
r
e
q
u
i
r
e
m
e
n
t
s
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
7
T
r
a
n
s
a
c
t
i
o
n
F
l
o
w
M
o
d
e
l
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
T
r
a
n
s
a
c
t
i
o
n
f
l
o
w
s
a
r
e
a
r
e
p
r
e
s
e
n
t
a
t
i
o
n
o
f
t
h
e
s
y
s
t
e
m
s
t
a
t
e
s
f
r
o
m
t
h
e
u
s
e
r
p
o
i
n
t
o
f
v
i
e
w
I
d
e
n
t
i
f
i
e
s
a
l
l
b
r
a
n
c
h
e
s
,
l
o
o
p
s
,
q
u
e
u
e
s
a
n
d
p
r
o
c
e
s
s
e
s
t
h
a
t
c
o
m
m
u
n
i
c
a
t
e
b
y
m
e
s
s
a
g
e
s
a
n
d
d
e
f
i
n
e
s
t
e
s
t
c
a
s
e
s
f
o
r
t
h
e
s
e
Y
o
u
n
e
e
d
a
s
u
f
f
i
c
i
e
n
t
n
u
m
b
e
r
o
f
t
r
a
n
s
a
c
t
i
o
n
f
l
o
w
c
h
a
r
t
s
t
o
c
o
v
e
r
a
l
l
p
o
s
s
i
b
l
e
t
r
a
n
s
a
c
t
i
o
n
s
S
e
l
e
c
t
a
s
u
f
f
i
c
i
e
n
t
n
u
m
b
e
r
o
f
p
a
t
h
s
t
h
r
o
u
g
h
t
h
o
s
e
t
r
a
n
s
a
c
t
i
o
n
f
l
o
w
s
t
o
a
s
s
u
r
e
c
o
m
p
l
e
t
e
c
o
v
e
r
a
g
e
(
e
v
e
r
y
l
i
n
k
a
n
d
e
v
e
r
y
d
e
c
i
s
i
o
n
i
s
b
e
i
n
g
e
x
e
r
c
i
s
e
d
a
t
l
e
a
s
t
o
n
c
e
)
H
o
w
t
o
u
s
e
i
t
?
8
T
r
a
n
s
a
c
t
i
o
n
F
l
o
w
M
o
d
e
l
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
One transaction flowchart
1 path = 1 test specification
A
B
A
=
a
n
e
x
a
m
p
l
e
o
f
a
s
i
n
g
l
e
p
a
t
h
B
=
a
n
e
x
a
m
p
l
e
o
f
a
c
o
m
b
i
n
a
t
i
o
n
o
f
p
a
t
h
s
Many paths or combinations of
paths to be tested
Q: what if a path fails?
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
10
A
l
l
R
o
u
n
d
-
T
r
i
p
P
a
t
h
s
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
U
s
e
d
t
o
t
r
a
v
e
r
s
e
t
h
e
g
r
a
p
h
(
s
t
a
t
e
m
a
c
h
i
n
e
)
a
n
d
t
o
g
e
n
e
r
a
t
e
a
t
r
a
n
s
i
t
i
o
n
t
r
e
e
A
t
t
e
m
p
t
s
t
o
e
x
e
r
c
i
s
e
r
o
u
n
d
t
r
i
p
p
a
t
h
s
C
o
v
e
r
s
1
0
0
%
o
f
t
h
e
p
a
t
h
s
round trip paths = paths that start and end in the same state
H
o
w
t
o
u
s
e
i
t
?
F
o
l
l
o
w
a
p
a
t
h
a
n
d
w
h
e
n
y
o
u
m
e
e
t
a
g
a
i
n
a
p
r
e
v
i
o
u
s
s
t
a
t
e
–
S
T
O
P
a
n
d
r
e
c
o
r
d
t
h
a
t
p
a
t
h
Create a test case for every resulted path
11
A
l
l
R
o
u
n
d
-
T
r
i
p
P
a
t
h
s
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
5 paths resulted with this technique => 5 test specifications (DOORS)
If one path fails the other paths can pass
O
F
F
(
D
e
f
a
u
l
t
)
O
N
3
0
m
i
n
O
N
1
5
s
e
c
F
a
d
e
o
u
t
3
s
e
c
F
a
d
e
o
u
t
3
s
e
c
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
13
L
o
o
p
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
R
e
p
e
t
i
t
i
v
e
p
r
o
c
e
s
s
e
s
a
r
e
d
i
f
f
i
c
u
l
t
t
o
s
t
a
r
t
o
r
s
t
o
p
c
o
r
r
e
c
t
l
y
I
s
e
f
f
e
c
t
i
v
e
f
o
r
m
o
s
t
g
r
a
p
h
m
o
d
e
l
s
t
h
a
t
h
a
v
e
l
o
o
p
s
loops = paths that end where they have started
H
o
w
t
o
u
s
e
i
t
?
S
e
t
p
r
e
c
o
n
d
i
t
i
o
n
s
t
o
s
t
a
r
t
a
l
o
o
p
Repeat loop N times
Check if the results are the same after every cycle
N
=
a
d
e
t
e
r
m
i
n
e
d
n
u
m
b
e
r
14
P
r
e
c
o
n
d
i
t
i
o
n
Open door:
set state “ON 30 min”
T
e
s
t
D
e
s
c
r
i
p
t
i
o
n
1) Close door:
set state “ON 15 sec”
2) Wait 15 sec: set state “Fade out 3 sec”
3) Open door: set state “ON 30 min”
4) Repeat steps 1, 2, 3 for N times (N = 3)
E
x
p
e
c
t
e
d
R
e
s
u
l
t
System is in state “ON 30 min” – the interior light is on for 30 minutes
L
o
o
p
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
16
D
a
t
a
F
l
o
w
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
A
d
a
t
a
p
r
o
d
u
c
e
d
i
n
o
n
e
s
t
a
t
e
i
s
e
x
p
e
c
t
e
d
t
o
b
e
u
s
e
d
l
a
t
e
r
I
n
f
o
r
m
a
t
i
o
n
r
e
c
e
i
v
e
d
b
y
a
r
e
c
e
i
v
i
n
g
s
t
a
t
e
R
x
h
a
s
t
o
b
e
t
h
e
s
a
m
e
a
s
t
h
e
o
n
e
s
e
n
t
f
r
o
m
t
h
e
t
r
a
n
s
m
i
s
s
i
o
n
s
t
a
t
e
T
x
I
n
f
o
r
m
a
t
i
o
n
t
h
a
t
p
a
s
s
e
s
f
r
o
m
s
t
a
t
e
t
o
s
t
a
t
e
i
s
c
r
e
a
t
i
n
g
a
d
a
t
a
f
l
o
w
H
o
w
t
o
u
s
e
i
t
?
Transmit
a data package
from one state to another state
Check if the information that arrives
at
the
receiving
state is correct
by the
action that state takes
State 1
State 2
17
D
a
t
a
F
l
o
w
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
N
e
w
r
e
q
u
i
r
e
m
e
n
t
a
d
d
e
d
:
If the light is ON and ignition is ON and the door is closed
the light should fade out in 3 seconds
D
a
t
a
F
l
o
w
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
“Ignition on” data should be sent from
state “ON 30 min” to state “Fade out 3
sec” through state “ON 15 sec” which
is bypassing the timer
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
20
E
q
u
i
v
a
l
e
n
c
e
P
a
r
t
i
t
i
o
n
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
T
h
e
i
n
p
u
t
o
f
a
d
o
m
a
i
n
i
s
d
i
v
i
d
e
d
i
n
c
l
a
s
s
e
s
o
f
d
a
t
a
H
o
w
t
o
u
s
e
i
t
?
The precondition is to determine what type of input is: a value, a range, etc.
Divide the input in classes, named partitions
They can be:
•
for a value, one valid and two invalid partitions
•
for a range, one valid and two invalid partitions
•
for a member of a set, one valid and one invalid partition
•
for a Boolean value, one valid and one invalid partition
21
E
q
u
i
v
a
l
e
n
c
e
P
a
r
t
i
t
i
o
n
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
R
a
n
g
e
o
f
v
a
l
u
e
s
t
h
a
t
a
r
e
p
o
s
s
i
b
l
e
t
o
b
e
u
s
e
d
:
[
1
0
…
6
0
]
m
i
n
u
t
e
s
All values are divided in 3 partitions
Dividing the range of values gives us the number of tests that can be made
for the boundary value analysis technique
0
1
0
6
0
∞
[min]
i
n
v
a
l
i
d
p
a
r
t
i
t
i
o
n
i
n
v
a
l
i
d
p
a
r
t
i
t
i
o
n
v
a
l
i
d
p
a
r
t
i
t
i
o
n
Time value
set in
EEPROM
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
23
B
o
u
n
d
a
r
y
V
a
l
u
e
A
n
a
l
y
s
i
s
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
B
a
s
e
d
o
n
t
h
e
p
a
r
t
i
t
i
o
n
s
t
h
a
t
w
h
e
r
e
d
e
t
e
r
m
i
n
e
d
w
i
t
h
e
q
u
i
v
a
l
e
n
c
e
p
a
r
t
i
t
i
o
n
i
n
g
t
e
c
h
n
i
q
u
e
,
w
e
c
a
n
d
e
t
e
r
m
i
n
e
t
h
e
t
e
s
t
s
t
h
a
t
w
e
h
a
v
e
t
o
m
a
k
e
B
o
u
n
d
a
r
i
e
s
a
n
d
v
a
l
u
e
s
a
r
o
u
n
d
t
h
e
m
a
r
e
t
e
s
t
e
d
Example for 3 partitions:
H
o
w
t
o
u
s
e
i
t
?
D
e
t
e
r
m
i
n
e
t
h
e
b
o
u
n
d
a
r
y
v
a
l
u
e
s
a
n
d
t
h
e
v
a
l
u
e
s
a
r
o
u
n
d
t
h
e
m
C
r
e
a
t
e
a
t
e
s
t
c
a
s
e
f
o
r
e
v
e
r
y
r
e
l
e
v
a
n
t
v
a
l
u
e
U
s
e
t
h
e
s
e
v
a
l
u
e
s
t
o
s
e
t
p
r
e
c
o
n
d
i
t
i
o
n
s
M
e
a
s
u
r
e
r
e
s
u
l
t
s
t
o
b
e
a
c
c
o
r
d
i
n
g
l
y
w
i
t
h
t
h
e
p
r
e
-
s
e
t
v
a
l
u
e
s
min
min-1
min+1
max
max-1
max+1
24
B
o
u
n
d
a
r
y
V
a
l
u
e
A
n
a
l
y
s
i
s
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
0
1
0
6
0
∞
[min]
z
1
<
1
0
z
2
>
6
0
1
0
<
=
x
<
=
6
0
Time value
set in
EEPROM
9
1
1
6
1
5
9
[
]
(
)
P
r
e
c
o
n
d
i
t
i
o
n
1) EEPROM time
value is set to 9
2) Set state “ON”
T
e
s
t
D
e
s
c
r
i
p
t
i
o
n
1) Check light and start stopwatch
2) Stop stopwatch when light is
OFF
E
x
p
e
c
t
e
d
R
e
s
u
l
t
Light is ON for X
minutes
(Resolution = 1)
1) EEPROM time
value is set to 10
2) Set state “ON”
1) Check light and start stopwatch
2) Stop stopwatch when light is
OFF
Light is ON for 10
minutes
(Resolution = 1)
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
26
R
e
g
r
e
s
s
i
o
n
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
I
n
a
s
y
s
t
e
m
a
n
e
w
f
e
a
t
u
r
e
i
s
i
m
p
l
e
m
e
n
t
e
d
T
e
s
t
i
n
g
t
h
e
n
e
w
e
r
v
e
r
s
i
o
n
o
f
t
h
e
s
y
s
t
e
m
b
y
u
s
i
n
g
t
h
e
s
a
m
e
t
e
s
t
c
a
s
e
s
o
f
t
h
e
p
r
e
v
i
o
u
s
v
e
r
s
i
o
n
o
f
t
h
e
s
y
s
t
e
m
,
f
o
r
t
h
e
f
e
a
t
u
r
e
s
t
h
a
t
a
r
e
n
o
t
c
h
a
n
g
e
d
H
o
w
t
o
u
s
e
i
t
?
Test the system by using the test cases that already exist
Write new test cases for the domains that include the new features
Other testing methods can be used to cover all failure possibilities of the
system
Use the new test cases and test the system further on
27
R
e
g
r
e
s
s
i
o
n
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
If the requirements were changed by adding the “Ignition ON / OFF”
condition, new tests have to be added to the specifications
The functionality of the system is changed with additional conditions, but the
test cases made for the first version can be reused
For example, the tests made with
“All round-trip paths” technique
are valid and can be reused
For the new feature added to the
system, new test cases have to
be created including the latest
conditions
28
P
o
s
i
t
i
v
e
v
s
.
N
e
g
a
t
i
v
e
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
c
o
m
p
a
r
i
s
o
n
P
o
s
i
t
i
v
e
T
e
s
t
i
n
g
–
g
i
v
i
n
g
a
s
i
n
p
u
t
v
a
l
i
d
d
a
t
a
N
e
g
a
t
i
v
e
T
e
s
t
i
n
g
–
g
i
v
i
n
g
a
s
i
n
p
u
t
i
n
v
a
l
i
d
d
a
t
a
Remark: All tests that have been made until now are examples of positive
testing
S
Y
S
T
E
M
S
Y
S
T
E
M
valid data
invalid data
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
30
N
e
g
a
t
i
v
e
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
D
e
f
i
n
i
n
g
a
s
i
n
p
u
t
a
n
i
n
v
a
l
i
d
d
a
t
a
H
o
w
t
o
u
s
e
i
t
?
Check the preconditions of the system
Define some input values that could appear, but are unspecified and seem to
be invalid for the system
Write test cases that uses those values as inputs
31
N
e
g
a
t
i
v
e
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
After a complete cycle with the
door open the system is back
to it’s default state OFF
Then the door is closed
There is nothing specified in
the requirements about this
Q: What does the system
should do?
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
33
E
r
r
o
r
G
u
e
s
s
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
B
a
s
e
d
o
n
e
x
p
e
r
i
e
n
c
e
a
n
d
j
u
d
g
m
e
n
t
o
f
t
h
e
t
e
s
t
e
r
I
s
t
h
e
a
r
t
o
f
f
i
n
d
i
n
g
h
i
d
d
e
n
e
r
r
o
r
s
H
o
w
t
o
u
s
e
i
t
?
Explore systems functionality
Think where a location for an error could be
The errors produced are mostly placed in exceptional places
The errors are actions that aren’t specified or unusual accessed
34
E
r
r
o
r
G
u
e
s
s
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
A
f
t
e
r
o
n
e
c
y
c
l
e
w
i
t
h
t
h
e
d
o
o
r
o
p
e
n
t
h
e
s
y
s
t
e
m
i
s
b
a
c
k
t
o
i
t
’
s
d
e
f
a
u
l
t
s
t
a
t
e
O
F
F
T
h
e
n
t
h
e
s
y
s
t
e
m
i
s
r
e
s
e
t
Q: Interior light is set to ON or
it should stay in OFF state?
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
36
E
r
r
o
r
H
a
n
d
l
i
n
g
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
A
s
y
s
t
e
m
s
h
o
u
l
d
r
e
c
o
g
n
i
z
e
a
n
d
l
o
c
a
t
e
t
h
e
e
r
r
o
r
37
E
r
r
o
r
H
a
n
d
l
i
n
g
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
The system should detect and save a DTC (Diagnostic Trouble Code) if the
light bulb is burned
N
e
w
r
e
q
u
i
r
e
m
e
n
t
a
d
d
e
d
:
If current I is 0 Amps then the DTC should set
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
39
R
e
c
o
v
e
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
A
s
y
s
t
e
m
s
h
o
u
l
d
r
e
c
o
v
e
r
f
r
o
m
i
t
’
s
e
r
r
o
r
s
t
a
t
e
t
o
i
t
’
s
i
n
i
t
i
a
l
s
t
a
t
e
40
R
e
c
o
v
e
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
For example, an error could appear if the bulb is burned or if a short-
circuit was produced
The system needs to locate this error and to announce that the interior
lighting system has a problem
Afterwards the bulb is replaced with a good one
The system is restarted
This time, the error shouldn’t appear anymore - the system has to
recover
OFF
(Default)
ON
30 min
D
T
C
i
s
a
c
t
i
v
e
D
T
C
i
s
n
o
t
a
c
t
i
v
e
Next
State
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
S
t
r
e
s
s
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
H
o
w
t
o
u
s
e
i
t
?
Repeating actions repeated times, without giving the system any breaks
Every tact the system should process something
42
R
e
q
u
i
r
e
s
t
o
h
o
l
d
t
h
e
s
y
s
t
e
m
i
n
c
o
n
t
i
n
u
o
u
s
a
c
t
i
o
n
f
o
r
a
l
o
n
g
t
i
m
e
S
y
s
t
e
m
s
h
o
u
l
d
p
e
r
f
o
r
m
u
n
d
e
r
n
o
r
m
a
l
c
o
n
d
i
t
i
o
n
s
,
b
u
t
i
t
s
h
o
u
l
d
p
e
r
f
o
r
m
u
n
d
e
r
e
x
t
r
e
m
e
c
o
n
d
i
t
i
o
n
s
,
t
o
o
S
t
r
e
s
s
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
Testing the timer for the “ON 15 sec”
state for 100 cycles
P
r
e
c
o
n
d
i
t
i
o
n
System is in OFF
(Default) mode
T
e
s
t
D
e
s
c
r
i
p
t
i
o
n
1) Open door (1s)
2) Close door (1s)
3) Wait 15s
4) Check light status to be ON
5) Wait 3s
6) Check light status to be OFF
7) Repeat steps 1-6 100 times
E
x
p
e
c
t
e
d
R
e
s
u
l
t
Time while light is ON
before is completely
OFF (fade out) is 20s
for every cycle
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
L
o
a
d
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
D
e
s
c
r
i
p
t
i
o
n
P
u
t
t
i
n
g
h
e
a
v
y
d
e
m
a
n
d
o
n
a
s
y
s
t
e
m
I
d
e
n
t
i
f
i
e
s
t
h
e
m
a
x
i
m
u
m
o
p
e
r
a
t
i
n
g
c
a
p
a
c
i
t
y
o
f
a
s
y
s
t
e
m
E
r
r
o
r
c
o
n
d
i
t
i
o
n
s
a
r
e
t
h
e
e
x
p
e
c
t
e
d
r
e
s
u
l
t
H
o
w
t
o
u
s
e
i
t
?
Determine maximum operating capacity
Entertain the system with continuous actions over capacity
Expect errors when the system is high demanded
L
o
a
d
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
’
s
I
m
p
l
e
m
e
n
t
a
t
i
o
n
E
x
a
m
p
l
e
The maximum power of the lamp is 15W
N
e
w
r
e
q
u
i
r
e
m
e
n
t
a
d
d
e
d
:
P
r
e
c
o
n
d
i
t
i
o
n
5W lamp is
mounted
T
e
s
t
D
e
s
c
r
i
p
t
i
o
n
Set state “ON 30 min”
E
x
p
e
c
t
e
d
R
e
s
u
l
t
System functions correctly
10W (default)
lamp is mounted
Set state “ON 30 min”
System functions correctly
15W lamp is
mounted
Set state “ON 30 min”
System functions correctly
20/25/30W lamp
is mounted
Set state “ON 30 min”
System not functioning /
relay is damaged
15W
20W
S
u
m
m
a
r
y
T
e
s
t
i
n
g
T
e
c
h
n
i
q
u
e
s
Transaction Flow Modeling
All Round-Trip Paths
Loop Testing
Data Flow Testing
Equivalence Partitioning
Boundary Value Analysis
Regression Testing
Negative Testing
Error Guessing
Error Handling Testing
Recovery Testing
Stress Testing
Load Testing
Hella KGaA Hueck & Co.
Testing is the process of demonstrating that errors are not present, establishing confidence in system functionality, and finding bugs. Techniques such as Transaction Flow Modeling, Equivalence Partitioning, and Error Handling are crucial for effective testing in software development.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
E N D
Presentation Transcript
5. Testing Techniques Foundation Level F-7761DE_C (2011-06) d
What is testing? Testing is the process of demonstrating that errors are not present. The purpose of testing is to show that a program performs its intended functions correctly. Testing is the process of establishing confidence that a system does what it is supposed to do. Testing is the process of finding errors. Test d
Why do we need a technique? A test technique / test strategy is used to generate tests An effective technique finds bugs Testing techniques are based on requirements Test d
Example: Car interior lighting system Customer requirements List of requirements: By opening the door of the car, the interior light should be turned on If the door stays open, the light keeps lightening for half an hour If the door is closed, the interior light will stay on another 15 seconds and then it should fade out in 3 seconds Test d 4
Example: Car interior lighting system Automotive requirements close door ON 30 min open door open door OFF (Default) ON 15 sec open door Fade out 3 sec Test d Test 5 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Transaction Flow Modeling Technique s Description Transaction flows are a representation of the system states from the user point of view Identifies all branches, loops, queues and processes that communicate by messages and defines test cases for these How to use it? You need a sufficient number of transaction flowcharts to cover all possible transactions Select a sufficient number of paths through those transaction flows to assure complete coverage (every link and every decision is being exercised at least once) Test d Test 7 d
Transaction Flow Modeling Technique s Implementation Example One transaction flowchart ON 30 min 2 1 1 path = 1 test specification 5 Many paths or combinations of paths to be tested OFF (Default) ON 15 sec 6 4 Q: what if a path fails? Fade out 3 sec 7 3 A = an example of a single path B = an example of a combination of paths 1 2 3 4 2 5 6 7 A OFF ON ON Fade out 3 sec ON ON ON Fade out 3 sec OFF (Default) 30 min 15 sec 30 min 15 sec 30 min (Default) 1 2 3 7 OFF ON ON Fade out 3 sec OFF (Default) 30 min 15 sec (Default) B 1 2 5 6 4 6 7 OFF ON ON ON Fade out 3 sec ON Fade out 3 sec OFF (Default) 30 min 15 sec 30 min 30 min (Default) Test d Test 8 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
All Round-Trip Paths Technique s Description Used to traverse the graph (state machine) and to generate a transition tree Attempts to exercise round trip paths Covers 100% of the paths round trip paths = paths that start and end in the same state How to use it? Follow a path and when you meet again a previous state STOP and record that path Create a test case for every resulted path Test d Test 10 d
All Round-Trip Paths Technique s Implementation Example OFF ON 30 min (Default) ON OFF (Default) ON 15 sec 30 min ON Fade out 3 sec 15 sec Fade out 3 sec ON Fade out 3 sec OFF ON 30 min 1 (Default) 2 30 min 3 ON OFF 30 min 4 (Default) 5 5 paths resulted with this technique => 5 test specifications (DOORS) If one path fails the other paths can pass Test d Test 11 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Loop Testing Technique s Description Repetitive processes are difficult to start or stop correctly Is effective for most graph models that have loops loops = paths that end where they have started How to use it? Set preconditions to start a loop Repeat loop N times Check if the results are the same after every cycle N = a determined number Test d Test 13 d
Loop Testing Technique s Implementation Example Precondition ON 30 min Open door: set state ON 30 min OFF (Default) ON 15 sec Test Description 1) Close door: set state ON 15 sec Fade out 3 sec 2) Wait 15 sec: set state Fade out 3 sec 3) Open door: set state ON 30 min 4) Repeat steps 1, 2, 3 for N times (N = 3) Expected Result System is in state ON 30 min the interior light is on for 30 minutes Test d Test 14 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Data Flow Testing Technique s Description A data produced in one state is expected to be used later Information received by a receiving state Rx has to be the same as the one sent from the transmission state Tx Information that passes from state to state is creating a data flow i State 1 State 2 How to use it? Transmit a data package from one state to another state Check if the information that arrives at the receiving state is correct by the action that state takes Test d Test 16 d
Data Flow Testing Technique s Implementation Example New requirement added: door open door closed If the light is ON and ignition is ON and the door is closed the light should fade out in 3 seconds light on fade out light light off ON 30 min time elapsed ignition on OFF (Default) ON 15 sec Fade out 3 sec Test d Test 17 d
Data Flow Testing Technique s Implementation Example ON 15 sec Fade out 3 sec ON 30 min OFF (Default) i serial bus ON ON Ignition on data should be sent from state ON 30 min to state Fade out 3 sec through state ON 15 sec which is bypassing the timer 30 min 30 min OFF (Default) (Default) OFF ON 15 sec 15 sec ON Fade out 3 sec 3 sec Fade out Test d Test d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Equivalence Partitioning Technique s Description The input of a domain is divided in classes of data How to use it? The precondition is to determine what type of input is: a value, a range, etc. Divide the input in classes, named partitions They can be: for a value, one valid and two invalid partitions for a range, one valid and two invalid partitions for a member of a set, one valid and one invalid partition for a Boolean value, one valid and one invalid partition Test d Test 20 d
Equivalence Partitioning Technique s Implementation Example Time value set in EEPROM [min] 0 10 60 invalid partition valid partition invalid partition Range of values that are possible to be used: [10 60] minutes All values are divided in 3 partitions Dividing the range of values gives us the number of tests that can be made for the boundary value analysis technique Test d Test 21 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Boundary Value Analysis Technique s Description Based on the partitions that where determined with equivalence partitioning technique, we can determine the tests that we have to make Boundaries and values around them are tested Example for 3 partitions: min-1 min min+1 max-1 max max+1 How to use it? Determine the boundary values and the values around them Create a test case for every relevant value Use these values to set preconditions Measure results to be accordingly with the pre-set values Test d Test 23 d
Boundary Value Analysis Technique s Implementation Example Time value set in EEPROM [ ( ) ] [min] 0 9 11 59 61 10 60 z1 < 10 10 <= x <= 60 z2 > 60 Precondition 1) EEPROM time value is set to 9 2) Set state ON Test Description 1) Check light and start stopwatch 2) Stop stopwatch when light is OFF Expected Result Light is ON for X minutes (Resolution = 1) 1) Check light and start stopwatch 2) Stop stopwatch when light is OFF Light is ON for 10 minutes 1) EEPROM time value is set to 10 2) Set state ON (Resolution = 1) Test d Test 24 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Regression Testing Technique s Description In a system a new feature is implemented Testing the newer version of the system by using the same test cases of the previous version of the system, for the features that are not changed How to use it? Test the system by using the test cases that already exist Write new test cases for the domains that include the new features Other testing methods can be used to cover all failure possibilities of the system Use the new test cases and test the system further on Test d Test 26 d
Regression Testing Technique s Implementation Example If the requirements were changed by adding the Ignition ON / OFF condition, new tests have to be added to the specifications The functionality of the system is changed with additional conditions, but the test cases made for the first version can be reused Ignition OFF For example, the tests made with All round-trip paths technique are valid and can be reused Ignition ON ( ON 30 min ) For the new feature added to the system, new test cases have to be created including the latest conditions && OFF (Default) ON 15 sec Fade out 3 sec Test d Test 27 d
Positive vs. Negative Testing Techniques comparison Positive Testing giving as input valid data Negative Testing giving as input invalid data SYSTEM SYSTEM valid data invalid data Remark: All tests that have been made until now are examples of positive testing Test d Test 28 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Negative Testing Technique s Description Defining as input an invalid data How to use it ? Check the preconditions of the system Define some input values that could appear, but are unspecified and seem to be invalid for the system Write test cases that uses those values as inputs Test d Test 30 d
Negative Testing Technique s Implementation Example After a complete cycle with the door open the system is back to it s default state OFF ON 30 min OFF (Default) Then the door is closed ON 15 sec There is nothing specified in the requirements about this Fade out 3 sec Q: What does the system should do? Precondition Open the door and let it open for 31 minutes (until light goes OFF) Test Description 1) Close the door 2) Check interior light Expected Result The light should NOT turn ON after the door is closed Test d Test 31 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Error Guessing Technique s Description Based on experience and judgment of the tester Is the art of finding hidden errors How to use it? Explore systems functionality Think where a location for an error could be The errors produced are mostly placed in exceptional places The errors are actions that aren t specified or unusual accessed Test Test d d Test 33 d
Error Guessing Technique s Implementation Example After one cycle with the door open the system is back to it s default state OFF Then the system is reset Cycle 1 Cycle after reset ON 30 min Q: Interior light is set to ON or it should stay in OFF state? OFF (Default) ON 15 sec Fade out 3 sec Precondition Open the door and let it open for 31 minutes (until light goes OFF) Test Description 1) Reset system 2) Check interior light Expected Result The light should turn ON if: door open & Reset Test d Test 34 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Error Handling Testing Technique s Description A system should recognize and locate the error Initial State Error State Test d Test 36 d
Error Handling Testing Technique s Implementation Example New requirement added: The system should detect and save a DTC (Diagnostic Trouble Code) if the light bulb is burned I A DTC If current I is 0 Amps then the DTC should set Test d Test 37 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Recovery Testing Technique s Description A system should recover from it s error state to it s initial state Initial State Error State Test d Test 39 d
Recovery Testing Technique s Implementation Example For example, an error could appear if the bulb is burned or if a short- circuit was produced The system needs to locate this error and to announce that the interior lighting system has a problem DTC is not active Next State ON 30 min DTC is active OFF (Default) Afterwards the bulb is replaced with a good one The system is restarted This time, the error shouldn t appear anymore - the system has to recover Test d Test 40 d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Stress Testing Technique s Description Requires to hold the system in continuous action for a long time System should perform under normal conditions, but it should perform under extreme conditions, too How to use it? Repeating actions repeated times, without giving the system any breaks Every tact the system should process something Test 42 d
Stress Testing Technique s Implementation Example Testing the timer for the ON 15 sec state for 100 cycles ON 30 min OFF (Default) ON 15 sec Fade out 3 sec Precondition System is in OFF (Default) mode Test Description 1) Open door (1s) 2) Close door (1s) 3) Wait 15s 4) Check light status to be ON 5) Wait 3s 6) Check light status to be OFF 7) Repeat steps 1-6 100 times Expected Result Time while light is ON before is completely OFF (fade out) is 20s for every cycle Test d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
Load Testing Technique s Description Putting heavy demand on a system Identifies the maximum operating capacity of a system Error conditions are the expected result How to use it? Determine maximum operating capacity Entertain the system with continuous actions over capacity Expect errors when the system is high demanded Test d Test d
Load Testing Technique s Implementation Example New requirement added: The maximum power of the lamp is 15W 15W 20W Precondition 5W lamp is mounted Test Description Set state ON 30 min Expected Result System functions correctly 10W (default) lamp is mounted System functions correctly Set state ON 30 min 15W lamp is mounted 20/25/30W lamp is mounted System functions correctly Set state ON 30 min System not functioning / relay is damaged Test Set state ON 30 min Test d d
Summary Testing Techniques Transaction Flow Modeling All Round-Trip Paths Loop Testing Data Flow Testing Equivalence Partitioning Boundary Value Analysis Regression Testing Negative Testing Error Guessing Error Handling Testing Recovery Testing Stress Testing Load Testing Test d Test d
