pith. sign in

arxiv: 1602.06599 · v1 · pith:F64ETCTZnew · submitted 2016-02-21 · 💻 cs.SE

Towards Unified Combinatorial Interaction Testing

classification 💻 cs.SE
keywords combinatorialtestingu-citinteractionunifiedcoveragecriteriamany
0
0 comments X
read the original abstract

We believe that we can exploit the benefits of combinatorial interaction testing (CIT) on many "non-traditional" combinatorial spaces using many "non-traditional" coverage criteria. However, this requires truly flexible CIT approaches. To this end, we introduce Unified Combinatorial Interaction Testing (U-CIT), which enables practitioners to define their own combinatorial spaces and coverage criteria for testing, and present a unified construction approach to compute specific instances of U-CIT objects. We, furthermore, argue that most (if not all) existing CIT objects are a special case of U-CIT and demonstrate the flexibility of U-CIT on a simple, yet realistic scenario.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.