FM Verification & Validation

 Verification is the process of checking that a software achieves its goal without any
bugs.
 It verifies whether the developed product fulfills the requirements that we have.
Verification is static testing. 
 Verification means Are we building the product right? 

 Activities involved in verification:

 Inspections
 Reviews
 Walkthroughs
 Desk-checking
FM Verification & Validation

 Validation is the process of checking whether the software product is up to the mark or in other
words product has high level requirements. it is validation of actual and expected product.
 Validation is the Dynamic Testing.
 Verification means Are we building the right product? 

 Activities involved in validation:

 Black box testing
 White box testing
 Unit testing
 Integration testing
 Black Box Testing: Black box testing involves testing a system with no prior
knowledge of its internal workings.
 A tester provides an input, and observes the output generated by the system under test.
This makes it possible to identify its response time, usability issues and reliability issues.

 White Box Testing: White Box Testing is software testing technique in which internal
structure, design and coding of software are tested to verify flow of input-output and to
improve design, usability and security.
 White box testing involves
 Internal security holes
 Broken or poorly structured paths in the coding processes
 The flow of specific inputs through the code
 Expected output
 Testing of each statement, object, and function on an individual basis
 Unit testing: Unit testing is a type of testing in which individual units or functions
of software testing. Its primary purpose is to test each unit or function. A unit is the
smallest testable part of an application. 
 The aim behind unit testing is to validate unit components with its performance.

 Integration testing (sometimes called integration and testing, abbreviated I&T) is

the phase in software testing in which individual software modules are combined and
tested as a group. Integration testing is conducted to evaluate the compliance of a
system or component with specified functional requirements.
Finite State Machine
What is finite state machine?

 Finite state machine (FSM) is a term used by programmers, mathematicians,

engineers and other professionals to describe a mathematical model for any
system that has a limited number of conditional states of being.

 That can be implemented with hardware or software and can be used to

simulate sequential logic and some computer programs.

 A system where particular inputs cause particular changes in state can be

represented using finite state machines. 
Sequential logic:

 In automata theory sequential logic is a type of logic circuit whose output

depends not only on the present value of its input signals but on the sequence of
past inputs, the input history as well.
FSM Examples:

 Our traffic lights state machine is said to be finite because we have a finite

number of states.
 That’s a simple thing, and it has 3 states, like we said above.

 There are many more examples of FSM like….

 A subway entrance turnstile
 A vending machine
FSM CONT……..

 A finite state machine may be implemented through software or hardware to

simplify a complex problem. Within an FSM, all states in consideration exist in a
finite list.

 State Transition:
 When a finite state machine switches between states, it is called a state transition.  
FSMs Types:

 There are two types of FSMs.

 Deterministic finite state machines.
 Non-Deterministic finite state machines
Deterministic finite state machines:

 DFSM refers to deterministic finite automata. Deterministic refers to the

uniqueness of the computation. The finite automata are called deterministic finite
automata if the machine is read an input string one symbol at a time.
 In DFA, there is only one path for specific input from the current state to the next
state.
 DFA does not accept the null move, i.e., the DFA cannot change state without any
input character.
 These machines are called finite because there are a limited number of possible
states which can be reached.
DFA Cont……
 Deterministic means when you apply a sting or alphabet on a state then it move to
only one particular / specific state.
 Automata are abstract mathematical models of machines that perform computations
on an input by moving through a series of states.
 DFA is donated by following symbols:
 DFA (Q,Σ,δ,q0​,F).
 Q = set of all finite state
 Σ = set of alphabets (a,b / 0,1)
 δ = Transition ( δ = Q x Σ Q)
 q0 = Start State
 F = Set of finite final sate

 F is subset of Q
DFA Example:

 Q = { a,b,c}
 Σ = { 0,1}
 q0 = { a}
 F = {c}

 Solution ??