An Optimized technique for Test Case Generation and Prioritization Using 'Tabu' Search and 'Data Clustering'

نویسندگان

  • Praveen Ranjan Srivastava
  • Aditya Vijay
  • Bhupesh Barukha
  • Prashant Singh Sengar
  • Rajat Sharma
چکیده

In practice, an available testing budget limits the number of test cases that can be executed over particular software. This paper presents a ―Tabu‖ search algorithm for the automatic generation of software test cases and their prioritization through clustering technique of data mining. The developed test case generator has a cost function for intensifying the search and another for diversifying the search, used when the intensification is not successful. It also combines the use of memory with a backtracking process to avoid getting stuck in local minima. Test case prioritization technique schedules test cases in an order that increases their effectiveness in meeting some performance goal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

Automated Software Testing Using a Metaheuristic Technique Based on Tabu Search

The use of techniques for automating the generation of software test cases is very important as it can reduce the time and cost of this process. The latest methods for automatic generation of tests use metaheuristic search techniques, i.e. Genetic Algorithms and Simulated Annealing. There is a great deal of research into the use of Genetic Algorithms to obtain a specific coverage in software te...

متن کامل

Comparison of particle swarm optimization and tabu search algorithms for portfolio selection problem

Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we  optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...

متن کامل

Test-Case Optimization Using Genetic and Tabu Search Algorithm in Structural Testing

Software test-case generation is the process of identifying a set of test cases. It is necessary to generate the test sequence that satisfies the testing criteria. For solving this kind of difficult problem there were a lot of research works, which have been done in the past. The length of the test sequence plays an important role in software testing. The length of test sequence decides whether...

متن کامل

Automated Test Data Generation Using Cuckoo Search and Tabu Search (CSTS) Algorithm

Software testing is a very important phase in the development of software. Testing includes the generation of test cases which, if done manually, is time consuming. To automate this process and generate optimal test cases, several meta-heuristic techniques have been developed. These approaches include genetic algorithm, cuckoo search, tabu search, intelligent water drop, etc. This paper present...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009