Outline
- Abstract
- Context
- Objective
- Method
- Results
- Conclusion
- Keywords
- 1. Introduction
- 2. Background and Related Work
- 2.1. Notation and Terminology
- 2.2. Testing Based on Selected Paths
- 2.3. Mutation Testing Criterion
- 2.4. Generating Test Cases
- 2.4.1. Symbolic Execution
- 2.4.2. the Feasible Path and Equivalent Mutant Problem
- 2.4.3. Selecting Tests That Kill Mutants
- 2.5. Practical Problems Posed by Mutation
- 2.6. Related Work
- 3. the Method Used
- 3.1. the Extended Shortest Path Method
- 3.2. Mutant Representation and Path Selection
- 3.3. Incremental Selection of Paths
- 3.4. Handling Infeasible Requirements
- 3.5. the Criterion for Selecting Uncovered Mutants
- 4. a Unified Mutation Testing System
- 4.1. Overview
- 4.2. Detailed Description
- 4.2.1. Parser
- 4.2.2. Test Models
- 4.2.3. Mutant Generator
- 4.2.4. Path Generation
- 4.2.5. Symbolic Executor
- 4.2.6. Mutant Execution
- 5. Experimental Regime
- 5.1. Experimental Results
- 5.2. the Effort Required by the Strategy
- 6. Discussion of the Results
- 6.1. Effectiveness of the Path Generation Method
- 6.2. Issues About Weak, Strong and Higher Order Mutation
- 6.3. the Influence of Infeasible Paths on the Required Effort
- 6.4. Scalability Issues and Limitations
- 6.5. Threats to Validity
- 7. Conclusion
- Acknowledgments
- References
رئوس مطالب
- چکیده
- 1. مقدمه
- 2. پیش زمینه و آثار تحقیقی مرتبط
- 2.1. نشان گذاری و اصطلاحات
- 2.2. تست بر اساس مسیرهای انتخاب شده
- 2.3. معیار تست جهش
- 2.4. ایجاد آزمایه ها
- 2.4.1. اجرا نمادی
- 2.4.2. مسیر عملی و مشکل تغییر پذیر معادل
- 2.4.3. انتخاب تست هایی که تغییر پذیرها را حذف می کنند (می کشند)
- 2.5. مشکلات عملی مطرح شده توسط جهش
- 2.6. آثار تحقیقی مرتبط
- 3. روش استفاده شده
- 3.1. روش کوتاه ترین مسیر گسترش یافته
- 3.2. نمایش تغییر پذیر و انتخاب مسیر
- 3.3. انتخاب نموی (افزایشی) مسیرها
- 3.4. کنترل الزامات غیر عملی
- 3.5. معیار برای انتخاب تغییرپذیر های پوشش داده نشده
- 4. یک سیستم تست جهش واحد
- 4.1. بررسی اجمالی
- 4.2. شرح مفصل
- 4.2.1. تجزیه گر
- 4.2.2. مدل های تست
Abstract
Context
Generally, mutation analysis has been identified as a powerful testing method. Researchers have shown that its use as a testing criterion exercises quite thoroughly the system under test while it achieves to reveal more faults than standard structural testing criteria. Despite its potential, mutation fails to be adopted in a widespread practical use and its popularity falls significantly short when compared with other structural methods. This can be attributed to the lack of thorough studies dealing with the practical problems introduced by mutation and the assessment of the effort needed when applying it. Such an incident, masks the real cost involved preventing the development of easy and effective to use strategies to circumvent this problem.
Objective
In this paper, a path selection strategy for selecting test cases able to effectively kill mutants when performing weak mutation testing is presented and analysed.
Method
The testing effort is highly correlated with the number of attempts the tester makes in order to generate adequate test cases. Therefore, a significant influence on the efficiency associated with a test case generation strategy greatly depends on the number of candidate paths selected in order to achieve a predefined coverage goal. The effort can thus be related to the number of infeasible paths encountered during the test case generation process.
Results
An experiment, investigating well over 55 million of program paths is conducted based on a strategy that alleviates the effects of infeasible paths. Strategy details, along with a prototype implementation are reported and analysed through the experimental results obtained by its employment to a set of program units.
Conclusion
The results obtained suggest that the strategy used can play an important role in making the mutation testing method more appealing and practical.
دانلود ترجمه تخصصی این مقاله دانلود رایگان فایل pdf انگلیسی