Test Case Generation using GOM Algorithm

Authors: Selvakumar Subramanian and Ramaraj Natarajan

Affiliation: Thiagarajar College of Engineering, Madurai, India, and G.K.M College of Engineering & Technology, Chennai, India.

Abstract: Software testing involves appropriate validation and verification of a software component developed during the software lifecycle. Usually testing costs often account to high budget in the software development process. In order to minimize the testing costs, researchers and practitioners automate the testing process rather than carry out manual testing. Test Case Generation is the process of automatically generating a collection of test cases which are applied to a system under test. This paper utilizes branch coverage criteria using the Generalized Optimization Meta heuristic (GOM) algorithm and code constraint graph (CCG) to efficiently maximize the coverage of all the branches. The experimental results show that the proposed test generation technique is effective in generating tests for an application at large.

Keywords: Test case generation, branch coverage, evolutionary algorithm, Code Constraint Graph.

Full text: PDF




Open Access Publication Policy

The Internetworking Indonesia Journal provides open access to all of its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. This follows the philosophy of the Open Journal Systems (see the Public Knowledge Project at pkp.sfu.ca). The journal will be published electronically and there are no subscription fees. Such access is associated with increased readership and increased citation of an author's work.

Publication Frequency

The Internetworking Indonesia Journal is published twice a year (semi-annual) in electronic format (PDF), carrying papers both in Bahasa Indonesia and in English. The journal does not accept requests for the translation of submitted manuscripts.

Website templates