Skip to main navigation Skip to search Skip to main content

Concurrent test algebra execution with combinatorial testing

  • Wei Tek Tsai
  • , Guanqiu Qi*
  • *Corresponding author for this work
  • Arizona State University

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Software-as-a-Service (SaaS) application plays an important role in daily life and needs to have high reliability and availability before publishing. Testing SaaS applications become important, as the large number of testing prior to their deployment. TA identifies faults in combinatorial testing for SaaS applications using existing test results and eliminates those related faults. Although TA eliminates a large number of configurations from considerations, it is still difficult to finish testing enormous combinations of services in a reasonable time. To improve TA analysis, this chapter proposes a concurrent TA analysis. It allocates workloads into different clusters of computers and performs TA analysis from 2-way to 6-way configurations. Different database designs are used to store the test results of various configurations. Faulty and operational table search algorithms are proposed to retrieve existing test results. One 25-component experiment is simulated using the proposed solutions. The same experiment is also simulated on multiple processors for concurrent TA analysis.

Original languageEnglish
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages53-67
Number of pages15
Edition9789811044809
DOIs
StatePublished - 2017
Externally publishedYes

Publication series

NameSpringerBriefs in Computer Science
Number9789811044809
Volume0
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

Fingerprint

Dive into the research topics of 'Concurrent test algebra execution with combinatorial testing'. Together they form a unique fingerprint.

Cite this