Title :
Test algebra for combinatorial testing
Author :
Wei-Tek Tsai ; Colbourn, C.J. ; Jie Luo ; Guanqiu Qi ; Qingyang Li ; Xiaoying Bai
Author_Institution :
Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA
Abstract :
This paper proposes a new algebraic system, Test Algebra (TA), for identifying faults in combinatorial testing for SaaS (Software-as-a-Service) applications. SaaS as a part of cloud computing is a new software delivery model, and mission-critical applications are composed, deployed, and executed in cloud platforms. Testing SaaS applications is a challenging task because new applications need to be tested when they are composed before they can be deployed for execution. Combinatorial testing algorithms can be used to identify faulty configurations and interactions from 2-way all the way to k-way where k is the number of components in the application. The TA defines rules to identify faulty configurations and interactions. Using the rules defined in the TA, a collection of configurations can be tested concurrently in different servers and in any order and the results obtained will be still same due to the algebraic constraints.
Keywords :
cloud computing; fault diagnosis; program testing; SaaS application testing; TA; algebraic constraints; algebraic system; cloud computing; cloud platforms; combinatorial testing; faulty configuration identification; mission-critical applications; software delivery model; software-as-a-service; test algebra; Algebra; Fault diagnosis; Program processors; Scalability; Servers; Software as a service; Testing; Combinatorial testing; SaaS; algebra;
Conference_Titel :
Automation of Software Test (AST), 2013 8th International Workshop on
Conference_Location :
San Francisco, CA
DOI :
10.1109/IWAST.2013.6595786