Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/424416
Title: Automated test case generation for path coverage using search based techniques
Researcher: Sahoo, Rashmi Rekha
Guide(s): Ray,Mitrabindha
Keywords: Computer Science
Computer Science Hardware and Architecture
Engineering and Technology
University: Siksha
Completed Date: 2021
Abstract: Generation of test cases is one of the key aspects of software testing tasks. Au- newlinetomatic test case generation reduces the time of the testing process and improves newlinethe efficiency and effectiveness of software testing. Finding bugs from software us- newlineing an optimum set of test cases is the primary goal of software testing. Obtaining newlineoptimum set of test cases is an optimization problem. Metaheuristic optimization newline(searching) techniques have been immensely used to automate software testing tasks. newlineThe application of metaheuristic searching techniques in software testing is termed newlineas Search-Based Testing (SBT). Nature-inspired algorithms play an important role newlinein the automatic/ semi-automatic generation of suitable test cases for software. The newlinemain aim of SBT is to achieve a high degree of automation with quality tests at newlinea low cost. The search process of a metaheuristic algorithm is guided by fitness newlinefunctions. In SBT, a fitness function is formulated mainly based upon the coverage newlinecriteria. Some of the most used criteria for code-based testing are statement cover- newlineage, branch coverage, decision coverage, and path coverage. Path-based testing is newlinea popular structural testing method that uses the source code of a program to find newlineevery possible executable linearly independent path. Adequate and accurate test newlinecases are required to test each path. The main objective of this thesis work is to newlinepropose a search-based model to generate test cases that will cover maximum paths newlineso that we can obtain maximum test efficiency within the available test resources. newlineThe objectives of this thesis work are: newline To cover the critical path (path having a low probability of execution at the newlinetime of automatic test case generation) along with covering the maximum path. newline Proposal of fitness function (Improved Combined Fitness) for critical pa newline
Pagination: 
URI: http://hdl.handle.net/10603/424416
Appears in Departments:Department of Computer Science

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File149.93 kBAdobe PDFView/Open
02_prelim pages.pdf891.64 kBAdobe PDFView/Open
03_content.pdf108.62 kBAdobe PDFView/Open
04_abstract.pdf82.29 kBAdobe PDFView/Open
05_chapter 1.pdf125.62 kBAdobe PDFView/Open
06_chapter 2.pdf334.06 kBAdobe PDFView/Open
07_chapter 3.pdf168.46 kBAdobe PDFView/Open
08_chapter 4.pdf470.46 kBAdobe PDFView/Open
09_chapter 5.pdf367.28 kBAdobe PDFView/Open
10_annexures.pdf94.49 kBAdobe PDFView/Open
11_chapter 6.pdf294.24 kBAdobe PDFView/Open
12_chapter 7.pdf100.01 kBAdobe PDFView/Open
80_recommendation.pdf174.43 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: