Test algebra for combinatorial testing

Wei Tek Tsai, Charles Colbourn, Jie Luo, Guanqiu Qi, Qingyang Li, Xiaoying Bai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publication2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings
Pages19-25
Number of pages7
DOIs
StatePublished - 2013
Event2013 8th International Workshop on Automation of Software Test, AST 2013 - San Francisco, CA, United States
Duration: May 18 2013May 19 2013

Other

Other2013 8th International Workshop on Automation of Software Test, AST 2013
CountryUnited States
CitySan Francisco, CA
Period5/18/135/19/13

Fingerprint

Algebra
Testing
Cloud computing
Servers

Keywords

  • algebra
  • Combinatorial testing
  • SaaS

ASJC Scopus subject areas

  • Software

Cite this

Tsai, W. T., Colbourn, C., Luo, J., Qi, G., Li, Q., & Bai, X. (2013). Test algebra for combinatorial testing. In 2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings (pp. 19-25). [6595786] https://doi.org/10.1109/IWAST.2013.6595786

Test algebra for combinatorial testing. / Tsai, Wei Tek; Colbourn, Charles; Luo, Jie; Qi, Guanqiu; Li, Qingyang; Bai, Xiaoying.

2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings. 2013. p. 19-25 6595786.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tsai, WT, Colbourn, C, Luo, J, Qi, G, Li, Q & Bai, X 2013, Test algebra for combinatorial testing. in 2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings., 6595786, pp. 19-25, 2013 8th International Workshop on Automation of Software Test, AST 2013, San Francisco, CA, United States, 5/18/13. https://doi.org/10.1109/IWAST.2013.6595786
Tsai WT, Colbourn C, Luo J, Qi G, Li Q, Bai X. Test algebra for combinatorial testing. In 2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings. 2013. p. 19-25. 6595786 https://doi.org/10.1109/IWAST.2013.6595786
Tsai, Wei Tek ; Colbourn, Charles ; Luo, Jie ; Qi, Guanqiu ; Li, Qingyang ; Bai, Xiaoying. / Test algebra for combinatorial testing. 2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings. 2013. pp. 19-25
@inproceedings{5ce389f6e5b9412ab66e6aff4f4cf371,
title = "Test algebra for combinatorial testing",
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 = "algebra, Combinatorial testing, SaaS",
author = "Tsai, {Wei Tek} and Charles Colbourn and Jie Luo and Guanqiu Qi and Qingyang Li and Xiaoying Bai",
year = "2013",
doi = "10.1109/IWAST.2013.6595786",
language = "English (US)",
isbn = "9781467361613",
pages = "19--25",
booktitle = "2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings",

}

TY - GEN

T1 - Test algebra for combinatorial testing

AU - Tsai, Wei Tek

AU - Colbourn, Charles

AU - Luo, Jie

AU - Qi, Guanqiu

AU - Li, Qingyang

AU - Bai, Xiaoying

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - algebra

KW - Combinatorial testing

KW - SaaS

UR - http://www.scopus.com/inward/record.url?scp=84885001910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885001910&partnerID=8YFLogxK

U2 - 10.1109/IWAST.2013.6595786

DO - 10.1109/IWAST.2013.6595786

M3 - Conference contribution

AN - SCOPUS:84885001910

SN - 9781467361613

SP - 19

EP - 25

BT - 2013 8th International Workshop on Automation of Software Test, AST 2013 - Proceedings

ER -