COMPONENT TESTING USING FINITE AUTOMATA SANJOY KUMAR DAS Reg. No:-14370036
Jul 18, 2015
COMPONENT TESTINGUSING
FINITE AUTOMATA
SANJOY KUMAR DAS
Reg. No:-14370036
What is Component-Based Software Engineering• Component Based software Engineering is an
approach to software development that based on software reuse.
• CBSE are mainly constructed with component.
• It emerged from the failure of Object Oriented Development.
• Component are more abstract than Object Class thats why we use CBSE instead of OOD(Object Oriented Development).
• In CBSE software is built by gathering deferent components of existing software from different vendors.
Why Component Based Software Engineering
• It is used for making the software application quickly and rapidly.
• It reduces cost and time of Software product.
Characteristic of Component
Standardized Independent Deployable Documented
Goal Of The Application
For a tester many difficulties arise in testing phase because the tester has a limited access to source code of the product. That’s why the additional information with the component can be used to Facilitate the testing.
This paper has to focus on testing of an application using finite automata which covers two types of testing NFA based and DFA based testing.
This paper uses unified modeling language (UML) to explain the working principle of this application.
What is UML Language for Specifying, visualizing, constructing,
and documenting of Software System. UML gives us the understanding of Static and
Dynamic Nature of a System.
The Working of the application is explain with help of three UML diagrams.
USE CASE DIAGRAMACTIVITY DIAGRAM
COLLABORATION DIAGRAM
IMPLEMENTATION OF COMPONENT BASED TESTING
USE CASE DIAGRAMUSE CASE diagram captures the dynamic behavior of the system.
ACTIVITY DIAGRAMIt just like a Flow chart that represents the flow from one activity to another
COLLABORATION DIAGRAM
The method call sequence is indicated by a special numbering technique.
FINITE AUTOMATA based testing
Finite Automata are used to test the application.
Finite Automata are considered a very useful model for pattern matching lexical analysis and for verifying all kind of system that have a finite number of distinct states for secure exchange of information
In this problem we are using NFA based testingand DFA based testing
What is NFA and DFA?
NFA based Testing The NFA diagram of this application is used to test
whether each and every path in the application is working correctly.
NFA based testing proves that the application is capable of finding the error.
DFA BASED testing
NFA to DFA conversion table
CONCLUSION On the Basic of NFA and DFA diagrams, the work flow of
the application is tested and the impact of the error is recorded as well.
This paper presents a new approach for testing the component based software system.
Finite Automata based testing is an easy way to test an application.
REFERENCE
WikipediaSoftware Engineering- SummervilleThe Unified Modeling Language User Guide-- Booch
THANK YOU