Automation Of Independent Path Searching using Depth First Search

Abstract

In a basis path testing, there are independent paths that must be passed/tested at least once to make sure there are no errors in the code and ensure all pseudocode have implemented on the code. Previously, the independent path was generated using the Genetic Algorithm, but the number of iterations influenced the likelihood of the emergence of the corresponding the independent path. Besides, the pseudocode was also unable to be used directly since it must be implemented first, this makes finding an independent path longer because it has to implement the code. This research aims to find out how to find the independent path directly from pseudocode using a graph and how

Generating Test Cases from Mobile Application using Depth First Search and Backtracking Techniques

“…Arwan and Rusdianto [6] used two approaches to find on an independent path directly from a pseudocode. They use graph theory and Depth First Search algorithm for finding an independent path.…”

“…Hence, many testers use automation of software testing in order to save cost and time but can give results more accurate compared with software testing that have been done manually. The task of test case generation can be converted into an optimal problem by heuristic search techniques as Genetic Algorithm [4], Depth-first search (DFS) [5] [6], Hill Climbing methods [7] and A* Algorithm [8]. This research focus in implementing two algorithms namely Depth First Search (DFS) algorithm and Backtracking algorithm to generate test cases.…”