Reducing Mutants with Mutant Killable Precondition

Chihiro Iida, Shingo Takada

研究成果: Conference contribution

13 被引用数 (Scopus)

抄録

Mutation analysis is a method for predicting the quality of test suite accurately. However, it has high computational cost due to the number of mutants that are generated. For example, the ROR (Relational Operator Replacement) mutation operator will generate seven mutants for just one relational operator. Naively applying multiple operators over the entire program can result in a high number of generated mutants. One way to reduce the number of mutants is to omit redundant mutants. In this paper, we propose an approach to reducing mutants by using mutant killable precondition to identify redundant mutants. A mutant killable precondition is a logical expression for killing a mutant. We focus on the conditional expression for control flow statements, such as if and while statements. We describe the mutant killable precondition for conditional expressions that compare numbers, e.g., x > 0. We then discuss mutants that are generated for such conditional expressions, and find the minimal set of mutants. Finally, we show the theoretical and empirical reduction rate of our approach.

本文言語English
ホスト出版物のタイトルProceedings - 10th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2017
出版社Institute of Electrical and Electronics Engineers Inc.
ページ128-133
ページ数6
ISBN(電子版)9781509066766
DOI
出版ステータスPublished - 2017 4月 13
イベント10th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2017 - Tokyo, Japan
継続期間: 2017 3月 132017 3月 17

Other

Other10th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2017
国/地域Japan
CityTokyo
Period17/3/1317/3/17

ASJC Scopus subject areas

  • ソフトウェア
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「Reducing Mutants with Mutant Killable Precondition」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル