A tool for automatic generation of dd-graph using adjacency matrix for software testing
- PDF / 1,292,451 Bytes
- 9 Pages / 595.276 x 790.866 pts Page_size
- 20 Downloads / 176 Views
ORIGINAL RESEARCH
A tool for automatic generation of dd‑graph using adjacency matrix for software testing M. Boopathi1 · R. Sujatha1 · C. Senthil Kumar2 Received: 30 November 2019 / Accepted: 9 July 2020 © Society for Reliability and Safety (SRESA) 2020
Abstract The aim of software testing is to execute the software code and identify the presence of bugs in the code, unreachable code and detect software failures, so that the defects could be discovered and corrected before the product is released to the end users. Testing process becomes very tedious if the program contains thousands or millions of lines. This tedious work can be handled better, by breaking the software into appropriate modules, and then test each module by the application of unit testing; so as to ensure functional requirements of each module. During testing, automatic generation of dd-graph helps in minimizing computation time and provides an easy way to detect software failures and bugs in a code during execution. The size of the code for a real time application is generally large and dd-graph generation and maneuverability are tedious. Also, identification of unreachable or uncovered porion in the path is practically difficult. The present investigation focuses to display decisions or p-uses in the software code through adjacency matrix under C++ programming language. The proposed approach is expected to be very useful for computer science engineers and software developers. Keywords Adjacency matrix · Adjacency list · Control flow graph · c-uses and p-uses · Dd-graph
1 Introduction The increasing use of automation has lead to a large scale application of sophisticated software in industries. However, in reality, development of such sophisticated software for high complex systems require high quality testing and the limitations in software quality testing (Kaliraj and Bharathi 2019). In any computer-based systems, software testing is an important process to demonstrate its quality and help in gaining customer satisfaction by detecting and removing errors, if any (Jatana and Suri 2019). Manual testing process and generation of test cases are both tedious as compared to automated processes, especially, if the number of lines of code is very large (Saadatjoo and Babamir 2019). In general, graph theory concepts are applied to many fields in computer science, software engineering, computer hardware and web designing etc. (Mishra et al. 2019). To * R. Sujatha [email protected] 1
Department of Mathematics, SSN College of Engineering, Kalavakkam 603110, India
Safety Research Institute, Atomic Energy Regulatory Board, Kalpakkam 603102, India
2
reduce the complexity in these situations, automated ddgraph (decision-to-decision graph) helps in the process to identify the presence of bugs. The automatic generation of dd-graph explores the defeasibility and non-feasibility of the test paths, number of iterations and test cases are generated using random and symbolic testing in Tanwer and Kumar (2010). To develop a dd-graph, an intermediate s
Data Loading...
