Towards Unified Combinatorial Interaction Testing

February 21, 2016 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hanefi Mercan, Cemal Yilmaz arXiv ID 1602.06599 Category cs.SE: Software Engineering Citations 0 Venue arXiv.org Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Software Engineering

Died the same way β€” πŸ‘» Ghosted