Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/15540
Title: APPLICATION OF RIVER FORMATION DYNAMICS IN SEARCH BASED SOFTWARE ENGINEERING
Authors: KHATRI, YOGITA
Keywords: CYCLOMETIC COMPLEXITY
CONTROL FLOW GRAPH
TEST SEQUENCE
PROGRAM UNDER TEST
RIVER FORMATION DYNAMICS
Issue Date: Jul-2016
Series/Report no.: TD NO.2681;
Abstract: Search Based Software Engineering (SBSE) is an emerging field, involves applying search based techniques to address the various problems related to different domains of software engineering. It is specially excelled in providing an ideally balanced solution to a software engineering problem involving several competing goals and provides optimal solution to give better prospects over tools and techniques required to grow a productive, proficient and cohesive approach. Software testing is the area which is benefitted the most. Although there are many testing related problems which are solved by search based techniques, but automatic test data generation is the prime activity, capturing researcher’s attention these days. Test path generation and prioritization is one of the important activities to reduce test effort. But it hardly gets importance in the existing literature as only few researchers have attempted to generate test sequences using different search based algorithms (Ant Colony Optimization, Genetic Algorithm, Tabu Search, Cuckoo Search, Firefly Algorithm), each having their own merits and demerits. Ideally none of them is perfect as far as complete path coverage and redundancy is concerned. This dissertation aims at carrying the SWOT (strengths, weaknesses, opportunities, threats) analysis of the area i.e. search based software engineering and improving the efficiency of software testing process by generating the optimal test sequences in the control flow graph (CFG) of the program under test (PUT) by using a novel swarm intelligence method called River Formation Dynamics(RFD), inspired by a natural phenomena of how drops transformed into river and then river into sea. It provides full path coverage with zero redundancy in transitions vi from one node to another. It also tries to prioritize the paths based on their strength, calculated in terms of their traversal by the drops.
URI: http://dspace.dtu.ac.in:8080/jspui/handle/repository/15540
Appears in Collections:M.E./M.Tech. Computer Engineering

Files in This Item:
File Description SizeFormat 
Yogita_Mtech_thesis_final.pdf1.59 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.