Documente Academic
Documente Profesional
Documente Cultură
TO PRESENTED BY
KORADA KUSA RAJU
(17131 F0020)
DOMAINS AND PATHS:
THE MODEL
A DOMAIN IS A SET
DOMAINS ,PATHS And PREDICATES
A DOMAIN CLOSURE
DOMIAN DIMENSINALITY
THE BUG ASSUMPTIONS
THE MODEL:
Domain testing can be based on the specifications , or
equivalent Implementation.
If it is based on the specification , It is a functional test
technique.
If it is based on the implementation ,it is a structural test
technique.
All inputs to a program can be considered as if they are
numbers.
An invalid input (e.g., value too big ) is just a special
processing case called “ reject” .
Schematic representation of Domain Testing:
A DOMAIN IS A SET:
An input domain is a set.
If the source language supports set definitions (E.g. PASCAL
set types and C enumerated types).
less testing is needed because the compiler does much of it
for us.
Domain testing does not work well with arbitrary discrete
sets of data objects.
Domain for a loop-free program corresponds to a set of
numbers defined over the input vector.
DOMAIN , PATHS AND PREDICATES:
DOMAIN: In mathematics , domain is a set of possible values of an
independent variable or the variables of a function.
E.g. y=sqrt(x+4)
x>=-4
PATHS: Path testing is the structural testing method that involves using
source code of a program in order to find every possible executable
paths.
PREDICATES: Predicates are expression that can be evaluated that a
Boolean values i.e., true or false.
E.g. If(a>b)
{
print(“a is large”);
}
else print(“b is large”);
If domain testing is applied to structure, then predicate
interpretation must be based on actual paths through
the routine – that is, based on the implementation
control flowgraph.