We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Meta Heuristic Search Technique for Dynamic Test Case Generation

by M. S. Geetha Devasena, M. L. Valarmathi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Number 12
Year of Publication: 2012
Authors: M. S. Geetha Devasena, M. L. Valarmathi
10.5120/4869-7294

M. S. Geetha Devasena, M. L. Valarmathi . Meta Heuristic Search Technique for Dynamic Test Case Generation. International Journal of Computer Applications. 39, 12 ( February 2012), 1-5. DOI=10.5120/4869-7294

@article{ 10.5120/4869-7294,
author = { M. S. Geetha Devasena, M. L. Valarmathi },
title = { Meta Heuristic Search Technique for Dynamic Test Case Generation },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 39 },
number = { 12 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume39/number12/4869-7294/ },
doi = { 10.5120/4869-7294 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:26:13.429898+05:30
%A M. S. Geetha Devasena
%A M. L. Valarmathi
%T Meta Heuristic Search Technique for Dynamic Test Case Generation
%J International Journal of Computer Applications
%@ 0975-8887
%V 39
%N 12
%P 1-5
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Software testing is an inevitable activity of software development which is crucial to the software quality and consumes approximately 50% of the software development cost. Test case design is the most important activity in testing which determines software quality. The program with the moderate complexity cannot be tested completely but verified only for input situations selected as test data. Innovative methods are emerging to perform testing as a whole and unit testing in particular with minimum effort and time. Unit testing is mostly done by developers under a lot of schedule pressure since the software companies find a compromise among functionality, time to market and quality. Thus there is a need for reducing unit testing time by optimizing and automating the process. Test suite generation is an error-prone, tedious and time consuming part of unit testing. A novel technique is proposed to automatically generate test cases from the input domain using meta heuristic search technique scatter search for branch coverage criteria with respect to cyclomatic complexity measure.

References
  1. Chilenski1, John Joseph Chilenski and Steven P. Miller, 1994. ‘Applicability of Modified Condition/Decision Coverage to Software Testing’, Software Engineering Journal Vol. 9, No. 5, pp.193-200.
  2. Edvardson, J. 1999. ‘A Survey on Automatic Test data generation’, In proceedings of the second conference on computer science and engineering Vol.2, No.1, pp.343-351.
  3. Eugenia Diaz, Javier Tuya, Raquel Blanco, Jose Javier Dolado, 2008. ‘A tabu search algorithm for structural software testing’, Computers and Operations Research Vol. 14, No. 3, pp.38-69.
  4. Ferguson and Korel, B. 1966. ‘The chaining approach for software test data generation’, ACMTOSEM vol. 5, pp.63-86.
  5. Glover, F. 1989. ‘Tabu search: part I’, ORSA Journal on Computing, Vol. 3, No.1,pp.190-206.
  6. Glover, F. 1990. ‘Tabu search: part II’, ORSA Journal on Computing, Vol. 4, No. 2, pp.4–32.
  7. Howden, W.E. 1977. ‘Symbolic testing and the DISSECT symbolic evaluation system’, IEEE Transactions on Software Engineering vol.3, no. 4, pp. 266-278.
  8. John Clarke, Mark Harman, Bryan Jones. 2000. ‘The Application of Metaheuristic Search techniques to Problems in Software Engineering’, IEEE Computer Society Press Vol.42, No.1, pp.247-254.
  9. Lindquist, T.E. and Jenkins, J.R. 1998.‘Test-case generation with IOGen’, IEEE Software vol.5, no.1,pp. 72-79.
  10. Lin, Yeh, P.L. 2001. ‘Automatic test data generation for path testing using Gas’, Information Sciences Vol. 4, No.13, pp. 47-64.
  11. McCabe, Tom, 1976. ‘A Software Complexity Measure’, IEEE Trans. Software Eng Vol.2, No.6, pp.308-320.
  12. McMinn, p. 2004. ‘Search Based Software Test Data Generation:A survey’, Journal on Software Testing, Verification, and Reliability vol.14, no.2, pp.105-156.
  13. Raquel Blanco , Javier Tuya , Belarmino Adenso-Díaz. 2009. ‘Automated test data generation using a scatter search approach’, Information and Software Technology Vol. 51, No.1, pp. 708-720.
  14. Tao Feng, Kasturi Bidarkar. 2008. ‘A Survey of Software Testing Methodology’ vol.25, no-3, pp.216-226.
  15. Voas, J.M, Morell, J. and Miller, K.W. 1991. ‘Predicting where faults can hide from testing’, IEEE vol: 8, pp, 41-48.
  16. Wegener, Baresel DeMillo RA, Offutt, A.J. 1991. ‘Constraint-based automatic test data generation’ IEEE Transactions on Software Engineering Vol.17.
  17. Boris Beizer. 2000. ‘Software Testing Techniques’, Second edition.
Index Terms

Computer Science
Information Sciences

Keywords

Software testing Unit testing Branch Coverage Criteria and Scatter Search

Powered by PhDFocusTM