Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1
Software Testing
From Lord's Kitchen
29-Dec-2008 SoItware Testing 2
ontent
- Essence
- Terminology
- lassification
- Unit, System .
- BlackBox, WhiteBox
- Debugging
- !EEE Standards
29-Dec-2008 SoItware Testing 3
Definition
- Clen Nyers
- Testing is the process of executing a
program with the intent of finding errors
29-Dec-2008 SoItware Testing 4
"bjective explained
- Paul ]orgensen
- Testing is obviously concerned with errors,
faults, failures and incidents. A test is the
act of exercising software with test cases
with an objective of
- Finding failure
- Demonstrate correct execution
29-Dec-2008 SoItware Testing 5
A Testing Life ycle
Requirement
Specs
Design
Coding
Testing
Fault
Resolution
Fault
Isolation
Fault
ClassiIication
Error
Fault
Fault
Fault
Error
Error
incident
Fix
29-Dec-2008 SoItware Testing 6
Terminology
- Error
- Represents mistakes made by people
- Fault
- !s result of error. Nay be categorized as
- Fault of ommission - we enter something into
representation that is incorrect
- Fault of "mission - Designer can make error of
omission, the resulting fault is that something
is missing that should have been present in the
representation
29-Dec-2008 SoItware Testing 7
ont.
- Failure
- "ccurs when fault executes.
- !ncident
- Behavior of fault. An incident is the
symptom(s) associated with a failure that
alerts user to the occurrence of a failure
- Test case
- Associated with program behavior. !t carries
set of input and list of expected output
29-Dec-2008 SoItware Testing 8
ont.
- verification
- Process of determining whether output of
one phase of development conforms to its
previous phase.
- validation
- Process of determining whether a fully
developed system conforms to its SRS
document
29-Dec-2008 SoItware Testing 9
verification versus validation
- verification is concerned with phase
containment of errors
- validation is concerned about the final
product to be error free
29-Dec-2008 SoItware Testing 10
Relationship - program behaviors
Program Behaviors
SpeciIied
(expected)
Behavior
Programmed
(observed)
Behavior
Fault
OI
Omission
Fault
OI
Commission
Correct portion
29-Dec-2008 SoItware Testing 11
lassification of Test
- There are two levels of classification
- "ne distinguishes at granularity level
- Unit level
- System level
- !ntegration level
- "ther classification (mostly for unit level) is
based on methodologies
- Black box (Functional) Testing
- White box (Structural) Testing
29-Dec-2008 SoItware Testing 12
Relationship - Testing wrt Behavior
Program Behaviors
SpeciIied
(expected)
Behavior
Programmed
(observed)
Behavior
Test Cases
(VeriIied behavior)
8
7
5 6
1
4
3
2
29-Dec-2008 SoItware Testing 13
ont.
- 2, S
- Specified behavior that are not tested
- 1, 4
- Specified behavior that are tested
- 3, 7
- Test cases corresponding to unspecified
behavior
29-Dec-2008 SoItware Testing 14
ont.
- 2, 6
- Programmed behavior that are not tested
- 1, 3
- Programmed behavior that are tested
- 4, 7
- Test cases corresponding to un
programmed behaviors
29-Dec-2008 SoItware Testing 15
!nferences
- !f there are specified behaviors for which
there are no test cases, the testing is
incomplete
- !f there are test cases that correspond to
unspecified behaviors
- Either such test cases are unwarranted
- Specification is deficient (also implies that
testers should participate in specification and
design reviews)
29-Dec-2008 SoItware Testing 16
Test methodologies
- Functional (Black box) inspects
specified behavior
- Structural (White box) inspects
programmed behavior
29-Dec-2008 SoItware Testing 17
Functional Test cases
SpeciIied
Programmed
Test
Cases
29-Dec-2008 SoItware Testing 18
Structural Test cases
SpeciIied
Programmed
Test
Cases
29-Dec-2008 SoItware Testing 19
When to use what
- Few set of guidelines available
- A logical approach could be
- Prepare functional test cases as part of
specification. However they could be used
only after unit and/or system is available.
- Preparation of Structural test cases could
be part of implementation/code phase.
- Unit, !ntegration and System testing are
performed in order.
29-Dec-2008 SoItware Testing 20
Unit testing - essence
- Applicable to modular design
- Unit testing inspects individual modules
- Locate error in smaller region
- !n an integrated system, it may not be
easier to determine which module has
caused fault
- Reduces debugging efforts
29-Dec-2008 SoItware Testing 21
Test cases and Test suites
- Test case is a triplet |!, S, "* where
- ! is input data
- S is state of system at which data will be
input
- " is the 70;1 output
- Test suite is set of all test cases
- Test cases are not randomly selected.
!nstead even they need to be designed.
29-Dec-2008 SoItware Testing 22
!eed for designing test cases
- Almost every nontrivial system has an
extremely large input data domain
thereby making exhaustive testing
impractical
- !f randomly selected then test case may
loose significance since it may expose
an already detected error by some
other test case
29-Dec-2008 SoItware Testing 23
Design of test cases
- !umber of test cases do not determine the
effectiveness
- To detect error in following code
if(x>y) max = x, else max = x,
- {(x=3, y=2), (x=2, y=3)} will suffice
- {(x=3, y=2), (x=4, y=3), (x=S, y = 1)} will
falter
- Each test case should detect different errors
29-Dec-2008 SoItware Testing 24
Black box testing
- Equivalence class partitioning
- Boundary value analysis
- omparison testing
- "rthogonal array testing
- Decision Table based testing
- ause Effect Craph
29-Dec-2008 SoItware Testing 25
Equivalence lass Partitioning
- !nput values to a program are
partitioned into equivalence classes.
- Partitioning is done such that:
-program behaves in similar ways to
every input value belonging to an
equivalence class.
29-Dec-2008 SoItware Testing 26
Why define equivalence classes?
- Test the code with just one
representative value from each
equivalence class:
- as good as testing using any other values
from the equivalence classes.
29-Dec-2008 SoItware Testing 27
Equivalence lass Partitioning
- How do you determine the equivalence
classes?
- examine the input data.
- few general guidelines for determining the
equivalence classes can be given
29-Dec-2008 SoItware Testing 28
Equivalence lass Partitioning
- !f the input data to the program is
specified by a range of values:
- e.g. numbers between 1 to S000.
- one valid and two invalid equivalence
classes are defined.
29-Dec-2008 SoItware Testing 29
Equivalence lass Partitioning
- !f input is an enumerated set of values:
- e.g. {a,b,c}
- one equivalence class for valid input values
- another equivalence class for invalid input
values should be defined.
29-Dec-2008 SoItware Testing 30
Example
- A program reads an input value in the
range of 1 and S000:
- computes the square root of the input
number
$"#%
29-Dec-2008 SoItware Testing 31
Example (cont.)
- There are three equivalence classes:
- the set of negative integers,
- set of integers in the range of 1 and S000,
- integers larger than S000.
29-Dec-2008 SoItware Testing 32
Example (cont.)
- The test suite must include:
- representatives from each of the three
equivalence classes:
- a possible test suite can be:
{S,S00,6000}.
29-Dec-2008 SoItware Testing 33
Boundary value Analysis
- Some typical programming errors occur:
- at boundaries of equivalence classes
- might be purely due to psychological
factors.
- Programmers often fail to see:
- special processing required at the
boundaries of equivalence classes.
29-Dec-2008 SoItware Testing 34
Boundary value Analysis
- Programmers may improperly use <
instead of <=
- Boundary value analysis:
- select test cases at the boundaries of
different equivalence classes.
29-Dec-2008 SoItware Testing 35
Example
- For a function that computes the square
root of an integer in the range of 1 and
S000:
- test cases must include the values:
{0,1,S000,S001}.
29-Dec-2008 SoItware Testing 36
ause and Effect Craphs
- Testing would be a lot easier:
- if we could automatically generate test
cases from requirements.
- Work done at !BN:
- an requirements specifications be
systematically used to design functional
test cases?
29-Dec-2008 SoItware Testing 37
ause and Effect Craphs
- Examine the requirements:
- restate them as logical relation between
inputs and outputs.
- The result is a Boolean graph representing
the relationships
- called a causeeffect graph.
29-Dec-2008 SoItware Testing 38
ause and Effect Craphs
- onvert the graph to a decision table:
- each column of the decision table
corresponds to a test case for functional
testing.
29-Dec-2008 SoItware Testing 39
Steps to create causeeffect graph
- Study the functional requirements.
- Nark and number all causes and
effects.
- !umbered causes and effects:
- become nodes of the graph.
29-Dec-2008 SoItware Testing 40
Steps to create causeeffect graph
- Draw causes on the LHS
- Draw effects on the RHS
- Draw logical relationship between
causes and effects
- as edges in the graph.
- Extra nodes can be added
- to simplify the graph
29-Dec-2008 SoItware Testing 41
Drawing auseEffect Craphs
A B
If A then B
A
C
If (A and B)then C
B
29-Dec-2008 SoItware Testing 42
Drawing auseEffect Craphs
A
C
If (A or B) then C
B
A
C
If (not(A and B)) then C
B
~
29-Dec-2008 SoItware Testing 43
Drawing auseEffect Craphs
A
C
If (not (A or B))then C
B
A B
If (not A) then B
~
~
29-Dec-2008 SoItware Testing 44
Example
- Refer "n the Experience of Using
auseEffect Craphs for Software
Specification and Test Ceneration" by
Amit Paradkar. AN Publications
29-Dec-2008 SoItware Testing 45
Partial Specification
- "... System Test and !nitialization Node:
"perational requirements: "perating
requirements for this mode are as follows:
- await the start of the boiler on standby signal
from the instrumentation system, then
- test the boiler water content device for normal
behavior and calibration constant consistency,
then
- check whether the steaming rate measurement
device is providing a valid output and indicating
zero steaming rate (taking into account its error
performance), then
29-Dec-2008 SoItware Testing 46
ont.
- if the boiler water content exceeds 60,000 lb.,
send the boiler content high signal to the
instrumentation system and wait until the water
content has been adjusted to 60,000 lb. by the
instrumentation system (using a dump valve), else
- if the boiler water content is below 40,000 lb.,
start any feedpump to bring it to 40,000 lb., then
- turn on all the feedpumps simultaneously for at
least 30 s and no more than 40 s and check that
the boiler content rises appropriately, that the
feedpump monitors register correctly, and that the
feedpump running indications register correctly,
then
29-Dec-2008 SoItware Testing 47
ont.
- turn feedpumps off and on if needed to
determine which feedpumps, feedpump
monitors, or feedpump running indications
are faulty.
29-Dec-2008 SoItware Testing 48
Exit ondition:
- if the water content measuring device is
not serviceable, go to shutdown mode,else
- if the steaming rate measurement device is
not serviceable, go to shutdown mode,
else
- if less than three feedpump/feedpump
monitor combinations are working
correctly, go to shutdown mode, else
...
29-Dec-2008 SoItware Testing 49
causes:
- 221 externally initiated (Either "perator or
!nstrumentation system)
- 220 internally initiated
- 202 operator initiated
- 203 instrumentation system initiated
- 201 bad startup
- 200 operational failure
- 137 confirmed keystroke entry
- 138 confirmed "shutnow" message
29-Dec-2008 SoItware Testing 50
ont.
- 136 multiple pumps failure (more than
one)
- 13S water level meter failure during
startup
- 134 steam rate meter failure during
startup
- 133 communication link failure
- 132 instrumentation system failure
- 131 180 and 181
29-Dec-2008 SoItware Testing 51
ont.
- 130 water level out of range
- 180 water level meter failure during
operation
- 181 steam rate meter failure during
operation
- !ote that some of the causes listed above are
used as dummies, and exist only for classification
purpose. These causes and their relationships
leading to the boiler shutdown are illustrated in
the auseEffect Craph in Figure 1.
29-Dec-2008 SoItware Testing 52
ause Effect
Craph
29-Dec-2008 SoItware Testing 53
Decision Table
- Two dimensional mapping of condition
against actions to be performed
- onditions evaluate to Boolean
- Action corresponds to expected activity
- They can be derived from ause Effect
graph too
- Nap cause as condition
- Nap effect as action
29-Dec-2008 SoItware Testing 54
ause effect graph Decision table
Cause
Cause 2
Cause 3
Cause 4
Cause
ffect
ffect 2
ffect 3
%est %est 2 %est 3 %est 4 %est
I I I
I
I
I I
$ I
X $
$
$ $
$
! !
$
I
$
A
A A
A A
!
! !
A
A
A
A A
X
X X
X
X
X
I
29-Dec-2008 SoItware Testing 55
ause effect graph Example
- Put a row in the decision table for each
cause or effect:
- in the example, there are five rows for
causes and three for effects.
29-Dec-2008 SoItware Testing 56
ause effect graph Example
- The columns of the decision table
correspond to test cases.
- Define the columns by examining each
effect:
- list each combination of causes that can
lead to that effect.
29-Dec-2008 SoItware Testing 57
ause effect graph Example
- We can determine the number of
columns of the decision table
- by examining the lines flowing into the
effect nodes of the graph.
29-Dec-2008 SoItware Testing 58
ause effect graph Example
- Theoretically we could have generated
2S=32 test cases.
- Using cause effect graphing technique
reduces that number to S.
29-Dec-2008 SoItware Testing 59
ause effect graph
- !ot practical for systems which:
- include timing aspects
- feedback from processes is used for some
other processes.
29-Dec-2008 SoItware Testing 60
WhiteBox Testing
- Statement coverage
- Branch coverage
- Path coverage
- ondition coverage
- Nutation testing
- Data flowbased testing
29-Dec-2008 SoItware Testing 61
Statement overage
- Statement coverage methodology:
- design test cases so that every statement
in a program is executed at least once.
- The principal idea:
- unless a statement is executed, we have
no way of knowing if an error exists in
that statement
29-Dec-2008 SoItware Testing 62
Statement coverage criterion
- "bserving that a statement behaves
properly for one input value:
- no guarantee that it will behave correctly
for all input values.
29-Dec-2008 SoItware Testing 63
Example
- int f1(int x, int y){
1. while (x != y){
2. if (x>y) then
3. x=xy,
4. else y=yx,
S. }
6. return x, }
29-Dec-2008 SoItware Testing 64
Euclid's CD computation algorithm
- By choosing the test set
{(x=3,y=3),(x=4,y=3), (x=3,y=4)}
- all statements are executed at least once.
29-Dec-2008 SoItware Testing 65
Branch overage
- Test cases are designed such that:
- different branch conditions is given true
and false values in turn.
- Branch testing guarantees statement
coverage:
- a stronger testing compared to the
statement coveragebased testing.
29-Dec-2008 SoItware Testing 66
Example
- Test cases for branch coverage can be:
{(x=3,y=3), (x=4,y=3), (x=3,y=4)}
29-Dec-2008 SoItware Testing 67
ondition overage
- Test cases are designed such that:
- each component of a composite conditional
expression given both true and false
values.
- Example
- onsider the conditional expression
((c1.and.c2).or.c3):
- Each of c1, c2, and c3 are exercised at
least once i.e. given true and false values.
29-Dec-2008 SoItware Testing 68
Branch testing
- Branch testing is the simplest condition
testing strategy
- compound conditions appearing in
different branch statements are given
true and false values.
29-Dec-2008 SoItware Testing 69
Branch testing
- ondition testing
- stronger testing than branch testing:
- Branch testing
- stronger than statement coverage testing.
29-Dec-2008 SoItware Testing 70
ondition coverage
- onsider a Boolean expression having n
components:
- for condition coverage we require 2n test
cases.
- practical only if n (the number of
component conditions) is small.
29-Dec-2008 SoItware Testing 71
Path overage
- Design test cases such that:
- all linearly independent paths in the
program are executed at least once.
- Defined in terms of
- control flow graph (FC) of a program.
29-Dec-2008 SoItware Testing 72
ontrol flow graph (FC)
- A control flow graph (FC) describes:
- the sequence in which different instructions
of a program get executed.
- the way control flows through the
program.
29-Dec-2008 SoItware Testing 73
How to draw ontrol flow graph?
- !umber all the statements of a
program.
- !umbered statements:
- represent nodes of the control flow graph.
- An edge from one node to another
node exists:
- if execution of the statement representing
the first node can result in transfer of
control to the other node.
29-Dec-2008 SoItware Testing 74
Example
int f1(int x,int y){
1. while (x != y){
2. if (x>y) then
3. x=xy,
4. else y=yx,
S. }
6. return x, }
29-Dec-2008 SoItware Testing 75
Example ontrol Flow Craph
2
3 4
2
3 4