328 - 33 - Powerpoint Slides - 4 Dynamic Testing Black Box Testing Techniques - Chapter 4

Software Testing
Naresh Chauhan, Assistant Professor in the

Department of Computer Engineering at the
YMCA University of Science and Technology,
Faridabad
1
© Oxford University Press 2011. All rights reserved.
Testing Techniques
• Dynamic testing techniques
• Static testing techniques
• Validation testing techniques
• Regression testing techniques
2
Dynamic Testing: Black Box
Testing Techniques
3
Objectives
• Black box testing ignores the structural details of the software.

• Test case designing using black box techniques.
• Boundary value analysis method
• Equivalence class testing method
• State table based testing method
• Decision table based testing method
• Cause-effect graphing method
4
Black Box Testing
Evolution of Software Testing
5
Black Box Testing
Evolution of Software Testing
• To test the modules independently.
• To test the functional validity of the software
• Interface errors are detected.
• To test the system behavior and check its performance.
• To test the maximum load or stress on the system.
• Customer accepts the system within defined acceptable limits.
6
Boundary Value Analysis (BVA)
7
Boundary Value Checking
• Test cases are designed by holding one variable at its extreme

value and other variables at their nominal values in the input
domain. The variable at its extreme value can be selected at:
– Minimum value (Min)

– Value just above the minimum value (Min+ )
– Maximum value (Max)
– Value just below the maximum value (Max-)
8
Boundary Value Checking
• Anom, Bmin
• Anom, Bmin+
• Anom, Bmax
• Anom, Bmax-
• Amin, Bnom
• Amin+, Bnom
• Amax, Bnom
• Amax-, Bnom
• Anom, Bnom
4n+1 test cases can be designed with boundary value checking

method.
9
Robustness Testing Method
A value just greater than the Maximum value (Max+)

A value just less than Minimum value (Min-)
• When test cases are designed considering above points in
addition to BVC, it is called Robustness testing.
• Amax+, Bnom
• Amin-, Bnom
• Anom, Bmax+
• Anom, Bmin-
It can be generalized that for n input variables in a module,

6n+1 test cases are designed with Robustness testing.
10
Software Testing
Worst Case Myths
Testing Method
• When more than one variable are in extreme values, i.e. when more
than one variable are on the boundary. It is called Worst case
testing method.
• It can be generalized that for n input variables in a module, 5n

test cases are designed with worst case testing.
11
Example
• A program reads an integer number within the range [1,100] and

determines whether the number is a prime number or not. Design all
test cases for this program using BVC, Robust testing and worst-
case testing methods.
• 1) Test cases using BVC
12
Example
• Test Cases Using Robust Testing
13
Equivalence Class Testing
• Equivalence Partitioning also called as equivalence class

partitioning ECP.
• It is a software testing technique that divides the input
data of a software unit into partitions of equivalent data
from which test cases can be derived.
• In principle, test cases are designed to cover each
partition at least once. This technique tries to define test
cases that uncover classes of errors, thereby reducing
the total number of test cases that must be developed.
• An advantage of this approach is reduction in the time
required for testing a software due to lesser number of
test cases.
14
• Goals
– Completeness
– nonredundancy
• Steps
– Identify equivalence class
– Design test cases
15
16
• Guidelines
– Range can be split into 2 or more equivalent
classes
– BVA can help in identifying the classes
– Different equivalent class can be made for
different category like input is
character(number, spl characters, alphabets)
– ….
17
• Identifying the test cases

– Assign a unique id number for each
equivalence class
– Try to write new test cases for uncovered
valid equivalent classes
18
Example
• A program reads three numbers A, B and C with range [1,50] and

prints largest number. Design all test cases for this program using
equivalence class testing technique.
I1 = {<A,B,C> : 1 ≤ A ≤ 50}
I2 = {<A,B,C> : 1 ≤ B ≤ 50}
I3 = {<A,B,C> : 1 ≤ C ≤ 50}
I4 = {<A,B,C> : A < 1}
I5 = {<A,B,C> : A > 50}
I6 = {<A,B,C> : B < 1}
I7 = {<A,B,C> : B > 50}
I8 = {<A,B,C> : C < 1}
I9 = {<A,B,C> : C > 50}
19
Example
• I1 = {<A,B,C> : A > B, A > C}

• I2 = {<A,B,C> : B > A, B > C}
• I3 = {<A,B,C> : C > A, C > B}
• I4 = {<A,B,C> : A = B, A ≠ C}
• I5 = {<A,B,C> : B = C, A ≠ B}
• I6 = {<A,B,C> : A = C, C ≠ B }
• I7 = {<A,B,C> : A = B = C}
20
State Table Based Testing
• Tables are useful tools for representing

and documenting many types of
information relating to test case design
• These are beneficial for the applications
described using state transition diagrams
and state tables.
21
Finite State Machine (FSM)-

Is a behavioral model whose outcome depends upon previous and
current inputs.
State Transition Diagrams or State Graph
It’s a pictorial representation of an FSM
22
• State Table
23
Steps for converting state graphs and states table into
test cases
1. Identify the states

2. Prepare state transition diagram after
understanding transitions between states
3. Convert the state graph into the state
table.
4. Analyse the state table for its
completeness
5. Create the corresponding testcases from
the statetable 24
25
26
Decision Table Based Testing
• BVC and ECP do not consider

combinations of input. These include each
input separately.
• For combinations of inputs critical
behaviour is expected
• Decision tables obtain their power from
logical expressions and take value
TRUE/FALSE
27
28
• Condition stub: list of input conditions

• Action stub: list of resulting action if
combination of i/p satisfies
• Condition entry: rule values T/F/I
• Action entry: satisfied then X
29
Example
• A program calculates the total salary of an employee with the conditions
that if the working hours are less than or equal to 48, then give normal
salary. The hours over 48 on normal working days are calculated at the rate
of 1.25 of the salary. However, on holidays or Sundays, the hours are
calculated at the rate of 2.00 times of the salary. Design the test cases
using decision table testing.
30
31
Cause-Effect Graphing based Testing
Basic Notations for Cause-Effect Graph
32
Example
• A program has been designed for the determination of nature of
roots of a quadratic equation. Quadratic equation takes three input
values from the range [0,100]. Design all test cases using Cause-
Effect graphing technique.
33
• C1: a ≠ 0
• C2: b = 0
• C3: c = 0
• C4: D > 0 where D is b2 – 4 * a * c
• C5: D < 0
• C6: D = 0
• C7: a = b = c
• C8: a = c = b/2
• E1: Not a quadratic equation
• E2: Real Roots
• E3: Imaginary Roots
• E4: Equal Roots
34
35
Cause-Effect Graphing Based Testing
36
Error Guessing
• Error guessing is the method used when all other methods fail or it is
the method for some special cases which need to be tested.
• It means error or bug can be guessed which do not fit in any of the
earlier defined situations. So test cases are generated for these
special cases.
37

328 - 33 - Powerpoint Slides - 4 Dynamic Testing Black Box Testing Techniques - Chapter 4

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

328 - 33 - Powerpoint Slides - 4 Dynamic Testing Black Box Testing Techniques - Chapter 4

Загружено:

Авторское право:

Доступные форматы

Software Testing

Naresh Chauhan, Assistant Professor in the

• Black box testing ignores the structural details of the software.

• To test the functional validity of the software

• Interface errors are detected.

• To test the system behavior and check its performance.

• To test the maximum load or stress on the system.

• Customer accepts the system within defined acceptable limits.

• Test cases are designed by holding one variable at its extreme

– Minimum value (Min)

4n+1 test cases can be designed with boundary value checking

A value just greater than the Maximum value (Max+)

It can be generalized that for n input variables in a module,

• It can be generalized that for n input variables in a module, 5n

• A program reads an integer number within the range [1,100] and

• 1) Test cases using BVC

• Test Cases Using Robust Testing

• Equivalence Partitioning also called as equivalence class

• Identifying the test cases

• A program reads three numbers A, B and C with range [1,50] and

• I1 = {<A,B,C> : A > B, A > C}

• Tables are useful tools for representing

Finite State Machine (FSM)-

1. Identify the states

• BVC and ECP do not consider

• Condition stub: list of input conditions

Basic Notations for Cause-Effect Graph

Вам также может понравиться