376047667657e62618f8 · Combinatorial Testing of Full Text Search in Web Applications
Combinatorial Testing of Full Text Search in Web Applications
Database driven web applications are some of most widely developed systems today. Testing these applications effectively and discovering difficult-to-find bugs continues to be a challenge for software engineers. In this paper, we show that combinatorial
{
"title_en": "Combinatorial Testing of Full Text Search in Web Applications",
"designation": "",
"series": "",
"status": "",
"date": "2017-08-18",
"date_original": "August 18, 2017",
"url": "https://www.nist.gov/publications/combinatorial-testing-full-text-search-web-applications",
"source": "NIST Publications",
"display_en": "",
"authors_en": "M S Raunak , David R. Kuhn , Raghu N. Kacker",
"abstract_excerpt_en": "Database driven web applications are some of most widely developed systems today. Testing these applications effectively and discovering difficult-to-find bugs continues to be a challenge for software engineers. In this paper, we show that combinatorial",
"id": "376047667657e62618f8",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Combinatorial Testing of Full Text Search in Web Applications",
"designation": "",
"series": "",
"status": "",
"date": "2017-08-18",
"date_original": "August 18, 2017",
"url": "https://www.nist.gov/publications/combinatorial-testing-full-text-search-web-applications",
"source": "NIST Publications",
"display_en": "",
"authors_en": "M S Raunak , David R. Kuhn , Raghu N. Kacker",
"abstract_excerpt_en": "Database driven web applications are some of most widely developed systems today. Testing these applications effectively and discovering difficult-to-find bugs continues to be a challenge for software engineers. In this paper, we show that combinatorial"
}
],
"translation_state": "none",
"possible_title_matches": 1
}