With new algorithms and tools, developers can apply high-strength combinatorial testing to detect elusive failures that occur only when multiple components interact. In pairwise testing, all possible pairs of parameter values are covered by at least one
{
"title_en": "Practical Combinatorial Testing: Beyond Pairwise",
"designation": "",
"series": "",
"status": "",
"date": "2008-06-01",
"date_original": "June 1, 2008",
"url": "https://www.nist.gov/publications/practical-combinatorial-testing-beyond-pairwise",
"source": "NIST Publications",
"display_en": "",
"authors_en": "David R. Kuhn , Yu Lei , Raghu N. Kacker",
"abstract_excerpt_en": "With new algorithms and tools, developers can apply high-strength combinatorial testing to detect elusive failures that occur only when multiple components interact. In pairwise testing, all possible pairs of parameter values are covered by at least one",
"id": "97f94437e7554e45a445",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Practical Combinatorial Testing: Beyond Pairwise",
"designation": "",
"series": "",
"status": "",
"date": "2008-06-01",
"date_original": "June 1, 2008",
"url": "https://www.nist.gov/publications/practical-combinatorial-testing-beyond-pairwise",
"source": "NIST Publications",
"display_en": "",
"authors_en": "David R. Kuhn , Yu Lei , Raghu N. Kacker",
"abstract_excerpt_en": "With new algorithms and tools, developers can apply high-strength combinatorial testing to detect elusive failures that occur only when multiple components interact. In pairwise testing, all possible pairs of parameter values are covered by at least one"
}
],
"translation_state": "none",
"possible_title_matches": 1
}