Please use this identifier to cite or link to this item:
|Title:||Automatic search-based testing with the required k-tuples criterion||Authors:||Sofokleous, Anastasis A.
Andreou, Andreas S.
|Keywords:||Automatic searches;Code coverage;Control and data flow graphs;Control flow graphs;Data flow;Data flow dependencies;Java program;Required k-tuples;Test case;Test data;Test data generation;Automatic testing;Computer software selection and evaluation;Data flow analysis;Genetic algorithms;Graphic methods;Java programming language;Software testing;Information systems||Category:||Electrical Engineering - Electronic Engineering - Information Engineering||Field:||Engineering and Technology||Issue Date:||2010||Publisher:||SciTePress||Source:||12th International Conference on Enterprise Information Systems, Funchal, Portugal, 8-12 June 2010||Conference:||International Conference on Enterprise Information Systems||Abstract:||This paper examines the use of data flow criteria in software testing and uses evolutionary algorithms to automate the generation of test data with respect to the required k-tuples criterion. The proposed approach is incorporated into an existing test data generation framework consisting of a program analyzer and a test data generator. The former analyses JAVA programs, creates control and data flow graphs, generates paths in relation to data flow dependencies, simulates test cases execution and determines code coverage on the control flow graphs. The test data generator takes advantage of the program analyzer capabilities and generates test cases by utilizing a series of genetic algorithms. The performance of the framework is compared to similar methods and evaluated using both standard and randomly generated JAVA programs. The preliminary results demonstrate the efficacy and efficiency of this approach.||URI:||http://ktisis.cut.ac.cy/handle/10488/3842||Type:||Conference Papers|
|Appears in Collections:||Δημοσιεύσεις σε συνέδρια/Conference papers|
Show full item record
Page view(s) 5071
checked on Jun 24, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.