Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1812.06286 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909386845192192 |
|---|---|
| author | Musco, Vincenzo Monperrus, Martin Preux, Philippe |
| author_facet | Musco, Vincenzo Monperrus, Martin Preux, Philippe |
| contents | In software engineering, impact analysis involves predicting the software elements (e.g., modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose an evaluation technique to predict impact propagation. Based on 10 open-source Java projects and 5 classical mutation operators, we create 17,000 mutants and study how the error they introduce propagates. This evaluation technique enables us to analyze impact prediction based on four types of call graph. Our results show that graph sophistication increases the completeness of impact prediction. However, and surprisingly to us, the most basic call graph gives the best trade-off between precision and recall for impact prediction. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1812_06286 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | A Large-Scale Study of Call Graph-based Impact Prediction using Mutation Testing Musco, Vincenzo Monperrus, Martin Preux, Philippe Software Engineering In software engineering, impact analysis involves predicting the software elements (e.g., modules, classes, methods) potentially impacted by a change in the source code. Impact analysis is required to optimize the testing effort. In this paper, we propose an evaluation technique to predict impact propagation. Based on 10 open-source Java projects and 5 classical mutation operators, we create 17,000 mutants and study how the error they introduce propagates. This evaluation technique enables us to analyze impact prediction based on four types of call graph. Our results show that graph sophistication increases the completeness of impact prediction. However, and surprisingly to us, the most basic call graph gives the best trade-off between precision and recall for impact prediction. |
| title | A Large-Scale Study of Call Graph-based Impact Prediction using Mutation Testing |
| topic | Software Engineering |
| url | https://arxiv.org/abs/1812.06286 |