Abstract
The notion of composition in the context of combinatorial test design naturally arises in situations where the output of one module is used as an input to another module. Composability of tests plans has several important benefits as it facilitates both test and model reuse in such sequential scenarios. In this paper we describe a method for an automatic construction of composable tests plans, one by-product of which is a test plan for the SUT, obtained by their composition. The proposed method is implemented using binary decision diagrams (BDDs), which allows for an efficient and scalable composition-oriented CTD for real-life testing problems. We evaluate the method on a case study of a composition of two Unix Shell operations.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 10th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2017 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 249-252 |
| Number of pages | 4 |
| ISBN (Electronic) | 9781509066766 |
| DOIs | |
| State | Published - 13 Apr 2017 |
| Event | 10th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2017 - Tokyo, Japan Duration: 13 Mar 2017 → 17 Mar 2017 |
Publication series
| Name | Proceedings - 10th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2017 |
|---|
Conference
| Conference | 10th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2017 |
|---|---|
| Country/Territory | Japan |
| City | Tokyo |
| Period | 13/03/17 → 17/03/17 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.
Keywords
- CTD
- Combinatorial testing
- Software quality
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality