Simplifying Control Flow Graphs for Reducing Complexity in Control Flow Testing
 |
International Journal of Computer Trends and Technology (IJCTT) |  |
| © 2019 by IJCTT Journal | ||
| Volume-67 Issue-8 |
||
| Year of Publication : 2019 | ||
| Authors : Myint Myitzu Aung, Kay Thi Win | ||
| DOI : 10.14445/22312803/IJCTT-V67I8P102 |
MLA Style:Myint Myitzu Aung, Kay Thi Win"Simplifying Control Flow Graphs for Reducing Complexity in Control Flow Testing" International Journal of Computer Trends and Technology 67.8 (2019): 7-12.
APA Style Myint Myitzu Aung, Kay Thi Win.Simplifying Control Flow Graphs for Reducing Complexity in Control Flow Testing International Journal of Computer Trends and Technology, 67(8),7-12.
Abstract
Control Flow Graph (CFG) is the graphical representation that contains all possible paths in the program execution. It is very essential part of the control flow testing but there are some challenges in generating the effective CFGs. These are how to reduce the complexity and isomorphism of the CFGs and how to check the feasibility of these CFGs. In this paper, these challenges are addressed by introducing the simplifying of CFGs. In the control flow testing, the execution order is determined which is the instruction or statement order of the program through a control structure and the tester needs to select a specific part of a large program to set the testing path. The CFGs of large programs are sliced to simplify and to reduce the complexity by using a program slicing technique, Tree Slicing which is also called Path-Sensitively Sliced CFG (PSS-CFG). It is a slicing and merging technique for different sub-trees under certain conditions. By using this technique, the complexity of these CFGs is reduced due to the simplifying of these graphs. Moreover, this paper shows that the code coverage of the program of simplified CFGs is also improved according to the experimental results of the benchmark dataset that is different from other recent researches because this system is tested in Java by converting the C dataset.
Reference
[1] S. Aditham, N. Ranganathan, ?A Novel Control-flow based Intrusion Detection Technique for Big Data Systems.? arXiv preprint arXiv:1611.07649, 2016 - arxiv.org
[2] Amighi, Afshin, et al., ?Provably correct control flow graphs from Javabytecode programs with exceptions.? International Journal on SoftwareTools for Technology Transfer (2015): 1-32.
[3] R. Gold, ?Control Flow Graphs and Code Coverage?, Int. J. Appl. Math. Comput. Sci., 2010, Vol. 20, No. 4, pp.739–749. DOI: 10.2478/v10006-010-0056-9
[4] V. Elodie, ?White box coverage and control flow graphs?, June 21, 2011.
[5] V. Ranganath and J. Hatcliff, ?Slicing concurrent java programs using indus and kaveri?, Inernational Journal on Software Tools for Technology Transfer.
[6] H. Watson, J. McCabe, ?Structured testing: a testing methodology using the cyclomatic complexity metric?, NIST Special Publication 500-235, September,1996.
[7] J. Jaffar, V. Murali, ?A Path-Sensitively Sliced Control Flow Graph?, FSE ’14, November 16-22, 2014, San Hong Kong, China. Copyright 2014 ACM.
[8] J. Arora, ?Static Program Slicing- An Efficient Approach for Prioritization of Test Cases for Regression Testing’, International Journal of Computer Applications (0975 – 8887) Volume 135 – No.13, February 2016, pp.18-23.
[9] Y. Dubey, D. Singh, and A. Singh, “Amalgamation of Automated Test Case Generation Techniques with Data Mining Techniques: A Survey?, International Journal of Computer Applications (0975 – 8887) Volume 134 – No.5, January 2016.
[10] I. Papadhopulli and E. Mece, ?Coverage Criteria for Search Based Automatic Unit Testing of Java Programs?, International Journal of Computer Science and Software Engineering (IJCSSE), Volume 4, Issue 10, October 2015.
[11] K. Satyam, ?Enhancement of branch coverage using java program code transformer?, National Institute of Technology Rourkela, Orissa, India. May, 2015.
[12] G. Jayaraman, V. Ranganath, and J. Hatcliff, ?Kaveri: delivering the indus java program slicer to eclipse?.
[13] M. Myitzu Aung, K. Thi Win, ?Improving Branch Coverage for White-box Testing?, 27th International Conference on Computer Theory and Applications (ICCTA 2017).
[14] Adekola, O.D, Idowu, S.A, Okolie, S.O, Joshua, J.V, Akinsanya, A.O, Eze, M.O, EbiesuwaSeun "Software Maintainability and Reusability using Cohesion Metrics". International Journal of Computer Trends and Technology (IJCTT) V54(2):63-73, December 2017. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.
Keywords
Control Flow Graph (CFG), Control Flow Testing, Path-Sensitively Sliced CFG.