Software Engineering

Aruna Malapati ¹, S. China Venkateswarlu ², A. Sree Lakshmi ³, P. Suma Latha ⁴

Affiliations
1 Department of CSE, BITS PILANI, Hyderabad, IN
2 HITS COE, Hyderabad, IN
3 Department of CSE, HITS COE, Hyderabad, IN
4 Department of CSE, Bhoj Reddy College of Engineering, Hyderabad, IN

Abstract

Path Testing is considered to be one of the best techniques since it ensures that every statement, predicate, branch is executed at least once. But the draw back is that, as the program size increases the test paths also increases and exhaustive testing is impossible. Hence we need techniques to identify the test paths so as to cover statements, predicates and branch. In our work we explore the graph theory approach and apply several operations so as to reduce the no of test paths. The main aim of this work is optimize Test paths for the given program. Consider a program that consists of loops, conditions etc., while writing test cases we will consider it as single test case but internally it contains more statements. The intent of path testing is to execute every statement at least once. To satisfy this control flow graph is generated and test cases are written. In our proposed system we try to explore the graph matrix and Euler graph methods to identify 1) Number of Test paths 2) Optimized test paths and many other operations to analyze the test paths. We automate the process of conversion of a structured program to a control flow graph represented in the form of adjacency matrix and determine minimum no of test cases needed for path testing. Manual process of determining test cases can be replaced with this automated system.

Keywords

Path Testing, Graph Matrix, Node Reduction Algorithm, Control Flow Graph.

Full Text