[Review] Predictive Mutation Testing

1. Predictive Mutation Testing
Jie Zhang, Ziyi Wang, Lingming Zhang, Dan Hao, Lei Zang, Shiyang
Cheng, Lu Zhang (ISSTA 2016)
1
Presentation by Jinhan

2. Can we obtain mutation testing results
without mutant execution?
2
High cost!

3. Predictive Mutation Testing (PMT)
• PMT aims to solve binary classification problem (killed or survived)
• We know how mutants look like and the results of test execution
of original program.
3

4. We know how mutants look like and the results of test
execution of original program.
• typeStatement
• typeOperator
• typeReturn
• infoComplextiy
• depInheritance
• LoC
• Ca
4
• numExecutedCovered
• numTestCovered
• numMutantAssertion
Features!

5. 5

6. 6
ModelFeatures Killed?
Yes
No

7. Study
7

8. Models
• Random Forest
• SVM
• Naïve Bayes
• J48
8

9. Subjects
9

10. Effectiveness
(cross-version)
10

11. Effectiveness
(cross-project)
11

12. Version Interval
12

13. Efficiency
13

14. Features
14
How many times the mutated statement is
executed by the whole test suite.
How many tests from the test suite cover
the mutated statement.

15. Classification Algorithms
15