Using Static Information of Program s to Partition the Input Domain in Search based Test Data Generation

Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 143

This Paper With 12 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_JIST-8-4_003

تاریخ نمایه سازی: 9 آبان 1401

Abstract:

The quality of test data has an important effect on the fault-revealing ability of software testing. Search-based test data generation reformulates testing goals as fitness functions, thus, test data generation can be automated by meta-heuristic algorithms. Meta-heuristic algorithms search the domain of input variables in order to find input data that cover the targets. The domain of input variables is very large, even for simple programs, while this size has a major influence on the efficiency and effectiveness of all search-based methods. Despite the large volume of works on search-based test data generation, the literature contains few approaches that concern the impact of search space reduction. In order to partition the input domain, this study defines a relationship between the structure of the program and the input domain. Based on this relationship, we propose a method for partitioning the input domain. Then, to search in the partitioned search space, we select ant colony optimization as one of the important and prosperous meta-heuristic algorithms. To evaluate the performance of the proposed approach in comparison with the previous work, we selected a number of different benchmark programs. The experimental results show that our approach has ۱۴.۴۰% better average coverage versus the competitive approach.

Authors

Atieh Monemi-Bidgoli

Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran

Hassan Haghighi

Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran