You are on page 1of 23

Software Engineering

MCA-303
Dr. K.P.Jayant
Senior Associate Professor, MCA
Department
ABES Engineering College, Ghaziaa!
2
Sub
Topic
Nos
Sub Topic name Lectur
er No
Slide
Nos
1 Transaction flow Testing:
Overview
L1 3
2 Transaction flow Grap L2 !
3 Transaction flow testing
tecni"ues
L3 1#
ref boris bei$er 3
%efinitions of Transaction&Transaction'flow& T(G
Transaction
) is a unit of wor* seen from s+stems user point of view,
) consists of a se"uence of operations performed b+ a s+stem&
persons or e-ternal devices,
) is created. begin /birt0 due to an e-ternal act 1 up on its
completion /closure0&
it remains in te form of istorical records,
2Since te transaction is no longer in te s+stem& e-cept in te
form of istorical records3
U2
ref boris bei$er 4
%efinitions of Transaction&Transaction'flow& T(G
Transaction-flow
Transaction'flow represents a s+stems processing, (unctional
testing metods are applied for testing T'(,
Transaction-flow Graph
TFG represents a beavioral /functional0 model of te
program /s+stem0 used for functional testing by an independent
system tester,
U2
5
6 Simple Transaction
Example: Te se"uence of steps in a transaction in an online information retrieval
s+stem
1, 6ccept inputs
2, 7alidate inputs /8irt of tr,0
3, Transmit ac*nowledgement to te user
4, 9rocess input
5, Searc file
!, :e"uest direction from user
;, 6ccept <nputs
#, 7alidate inputs
=, 9rocess te re"uest
1>, ?pdate file
11,Transmit output
12,:ecord transaction in log 1 cleanup /@losure0
Users View of a transaction : Single step
Systems view : Se"uence of man+ operations
U2-B
ref boris bei$er !
(or e-ample& an automatic ban* teller macine 6TA can
be used for witdrawals& deposits& bill pa+ments& and
mone+ transfers,
(urtermore& tese operations can be done for a
cec*ing account& savings account& vacation account&
@urrent 6ccount& and so on,
6ltoug te se"uence of operations ma+ differ from
transaction to transaction& most transactions ave
common operations,
Suc tat& te automatic teller macine begins ever+
transaction b+ validating te users card and password
number,
ref boris bei$er ;
Example of a Transaction flow (diaram!
?ser /terminal0 Terminal controller @9?
U2
User User
Bein Bein
"e#$est
order
from %&U
"e#$est
Type
cancel
order
elp
'ccept
(rder from
%&U
&rocess
Form
B
B
Transmit
&ae to
terminal
%
'ccept
)np$t
Field
*ore
Fields+
,
Transmit
To @9?
-
User wants
"eview+
-
@9?'
6ccept
@onfirm
Valid +
,
*ore
&aes +
.
-one -one
Transmit
-ianostic
to Terminal
%
.
Set $p
"eview
ref boris bei$er #
%efinitions
Transaction-flow Graph : a scenario between users 1
computer
Transaction-flow :an internal se"uence of events in
processing a transaction
Uses of Transaction-flow
Specif+ing re"uirements of big& online and complicated
s+stems,
6irline reservation s+stems& air'traffic control s+stems,
Loops are less as compared to @(G, Loops are used for user
input error processing
U2
ref boris bei$er =
<mplementation of Transaction'(low
U2
System %ontrol Str$ct$re (arcitecture of te implementation! /
(ront
Bnd
<nput
Cueue E0E%UT)VE
S%1E-U2E" ' 6N% . O: (&E"'T).G S,STE*
-)S&'T%1E"
Output
Aodule
Output
Cueue
9rocess
Cueues
' 9rocessor B 9rocessor % 9rocessor - 9rocessor E 9rocessor
6pplication 9rocesses
%o 6ll Bs
%o 6ll -s
%isc
:eads
%isc
:eads
%o 6ll %s
%o 6ll 's
Tape
Drites
Tape
:eads
%o 6ll Bs
%o 6ll Es
%isc
Drites
%isc
Drites
2
1
1
2
Exec$tive 3 -ispatcher Flowchart (a sample sequence)
ref boris bei$er 1>
6 perspective of Transaction'(low
U2
Transaction'flow testing is a bloc* bo- tecni"ue,
(as we assumed nothing regarding computer, communications,
environment, O.S., transaction identity or structure or state.)
1, T(G is a *ind of %(G,
) T(G as to*ens& 1 %(G as data obEects wit istor+ of
operations applied on tem,
) Aan+ tecni"ues of @(G appl+ to T(G 1 %(G
24 -ecision nodes of T(G ave e-ception e-its to te central
recover+ process,
3, So& we ignore te effect of interr$pts in a Transaction'flow,
Transaction (lows F splitting 1 merging decisions
ref boris bei$er 11
U2-B
Splits of transactions (Births!
54 ' decision point in TFG
6lternative 1
6lternative 2
%augter Tr,
9arent
9arent
-a$hter Tr4
-a$hter Tr4
&arent
24 Biosis
64*itosis
Transaction (lows F splitting 1 merging decisions
ref boris bei$er 12
U2
*erers of transactions *erers of transactions
54 54 7$nction 7$nction
-a$hter &arent
&arent
64 %on8$ation
&ath 2
&ath 5
%ontin$e
-a$hter Tr4
&redator
&redator
24 '9sorption
T(G F splitting& merging Transactions
ref boris bei$er 13
U2

.(TES/ .(TES/
) Aultiple meanings now for decision and Eunction s+mbols in a T(G,
) Simple T(G model is not eno$h to represent multi'processor
s+stems 1 associated coordination s+stems,
) &etrinet model uses operations for all te above, 8ut 9etrinets are
applied to G.D& N.D protocol testing F but not Software,
Transaction ' (low Testing ' Steps
ref boris bei$er 14
U2-B
First: B$ild 3 (9tain Transaction Flows First: B$ild 3 (9tain Transaction Flows
)
"epresent Explicitly "epresent Explicitly
)
-esin details the *ain Tr-Flows -esin details the *ain Tr-Flows
)
%reate From &-2 %reate From &-2
)
1)&( charts ; &etrinet "epresentations 1)&( charts ; &etrinet "epresentations
(98ective < Trace the transaction (98ective < Trace the transaction
Transaction ' (low Testing ' Steps
ref boris bei$er 15
U2-B
54 54 )nspections: "eviews ; =al>thro$hs )nspections: "eviews ; =al>thro$hs
Start From &reliminary -esin Start From &reliminary -esin
54 54 %ond$ctin =al>thro$hs %ond$ctin =al>thro$hs
)
-isc$ss eno$h Transaction Types ( -isc$ss eno$h Transaction Types (=#H Transactions! !
)
User needs ; F$nctional terms User needs ; F$nctional terms (Design independent)
)
Tracea9ility to "e#$irements Tracea9ility to "e#$irements
Transaction ' (low Testing ' Steps
ref boris bei$er 1!
U2-B
54 54 )nspections: "eviews ; =al>thro$hs ? )nspections: "eviews ; =al>thro$hs ?
24 24 -esin Tests for %5 @ %2 coverae -esin Tests for %5 @ %2 coverae
64 64 'dditional %overae (A %5@%2! 'dditional %overae (A %5@%2!
) 9ats wit loops& e-treme values& domain boundaries
) =eird cases: lon ; potentially tro$9lesome Tr4
B4 B4 -esin Test cases for Tr4 Splits ; merers -esin Test cases for Tr4 Splits ; merers
C4 C4 &$9lish Selected Test &aths early &$9lish Selected Test &aths early
D4 D4 B$yerEs 'cceptance < f$nctional ; acceptance tests B$yerEs 'cceptance < f$nctional ; acceptance tests
Transaction ' (low Testing Tecni"ues
ref boris bei$er 1;
U2-B
24 24 &ath Selection &ath Selection
54 54 %overin Set (%5@%2! of F$nctionally Sensi9le Tr4 %overin Set (%5@%2! of F$nctionally Sensi9le Tr4
24 24 'dd -iffic$lt &aths 'dd -iffic$lt &aths
) :eview wit designers 1 implementers
) B-posure of interface problems 1 duplicated processing
) 7er+ few <mplementation bugs ma+ remain
Transaction'flow 9at @overing Set belongs in
S+stem (eature Tests
Transaction ' (low Testing Tecni"ues
ref boris bei$er 1#
U2-B
64 64 SensitiFation SensitiFation
54 F$nctionally Sensi9le &aths < Simple
24 Error: Exception: External &rotocol )nterface &aths - -iffic$lt
Testin Tr4<Flows with External )nterfaces
) ?se patces 1 brea* points& mistune& and brea* te rules&
Transaction ' (low Testing Tecni"ues
ref boris bei$er 1=
U2-B
B4 B4 )nstr$mentation )nstr$mentation
54 2in> %o$nters are not Usef$l4
24 .eed
) Trace
) Cueues on wic To*ens resided
) Bntries to 1 B-its from %ispatcer
) 6 :unning Log
Aa*e <nstrumentation as part of S+stem %esign
Transaction ' (low Testing Tecni"ues
ref boris bei$er 2>
U2-B
C4 C4 Test -ata 9ases Test -ata 9ases
54 -esin ; *aintenance of a Test -ata 9ase - Effort
2, Aista*es
) ?nawareness about design of a centrall+ administered test %8
) Test %8 design b+ Testers
) ?sing one %8 for all tests /need 4 to 50
Need e-perienced S+stem 1 Test %esigners
Transaction ' (low Testing Tecni"ues
ref boris bei$er 21
U2-B
D4 D4 Test Exec$tion Test Exec$tion
54 Use Test Exec$tion '$tomation
2, Gave to do a large I of Tests for @1J@2 coverage
Transaction ' (low Testing ' <mplementation
ref boris bei$er 22
U2-B
54 54 Transaction 9ased systems Transaction 9ased systems
)
T%B T%B
54 54 %entraliFed: %ommon &rocessin G$e$es %entraliFed: %ommon &rocessin G$e$es
)
7$st ((n! G$e$es for 2in>s of ((n 7$st ((n! G$e$es for 2in>s of ((n
2 2
! !
24 24 Transaction -ispatcher Transaction -ispatcher
)
Uses ta9les ; Finite State *achines Uses ta9les ; Finite State *achines
64 64 "ecovery ; (ther 2os "ecovery ; (ther 2os
)
Hey events in Tr < Flow Hey events in Tr < Flow
B4 B4 Self-Test S$pport Self-Test S$pport
)
&rivileed modes in Transaction control ta9les &rivileed modes in Transaction control ta9les
23
C,1, %istinguis @ontrol (low and Transaction flow,
C,2, Dat is meant b+ transaction flow testing,
%iscuss its significance,

You might also like