Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ICSTW.2017.45 | 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) |
Keywords | Field | DocType |
combinatorial testing,software quality,CTD | Programming language,Test plan,Reuse,Computer science,Software bug,Binary decision diagram,Unix,Combinatorial design,Composability,Scalability | Conference |
ISSN | ISBN | Citations |
2159-4848 | 978-1-5090-6677-3 | 1 |
PageRank | References | Authors |
0.36 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anna Zamansky | 1 | 245 | 43.38 |
| Amir Shwartz | 2 | 1 | 0.36 |
| Seri Khoury | 3 | 14 | 3.45 |
| Eitan Farchi | 4 | 590 | 46.38 |