? Automated Testing of Web Applications Using Combinatorial Strategies
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2017, Vol. 32 Issue (1) :199-210    DOI: 10.1007/s11390-017-1699-x
Regular Paper Current Issue | Archive | Adv Search << Previous Articles | >>
Automated Testing of Web Applications Using Combinatorial Strategies
Xiao-Fang Qi1,2(戚晓芳), Member, CCF, ACM, Zi-Yuan Wang3(王子元), Member, CCF, IEEE, Jun-Qiang Mao1(茆俊强), and Peng Wang1(汪鹏), Member, CCF, ACM, IEEE
1 School of Computer Science and Engineering, Southeast University, Nanjing 211189, China;
2;Key Laboratory of Computer Network and Information Integration, Ministry of Education, Nanjing 211189, China;
3 School of Computer Science and Technology, Nanjing University of Posts and Telecommunications Nanjing 210023, China

Abstract
Reference
Related Articles
Download: [PDF 407KB]     Export: BibTeX or EndNote (RIS)  
Abstract Recently, testing techniques based on dynamic exploration, which try to automatically exercise every possible user interface element, have been extensively used to facilitate fully testing web applications. Most of such testing tools are however not effective in reaching dynamic pages induced by form interactions due to their emphasis on handling client-side scripting. In this paper, we present a combinatorial strategy to achieve a full form test and build an automated test model. We propose an algorithm called pairwise testing with constraints (PTC) to implement the strategy. Our PTC algorithm uses pairwise coverage and handles the issues of semantic constraints and illegal values. We have implemented a prototype tool ComjaxTest and conducted an empirical study on five web applications. Experimental results indicate that our PTC algorithm generates less form test cases while achieving a higher coverage of dynamic pages than the general pairwise testing algorithm. Additionally, our ComjaxTest generates a relatively complete test model and then detects more faults in a reasonable amount of time, as compared with other existing tools based on dynamic exploration.
Articles by authors
Xiao-Fang Qi
Zi-Yuan Wang
Jun-Qiang Mao
Peng Wang
Keywordsautomated testing   combinatorial testing   web application     
Received 2016-03-21;
Fund:

This work is supported by the National Natural Science Foundation of China under Grant Nos. 61472076, 61472077, and 61300054.

About author: Zi-Yuan Wang received his Ph.D. degree in computer science from Southeast University, Nanjing, in 2009. He is currently an associate professor in the School of Computer Science and Technology, Nanjing University of Posts and Telecommunications, Nanjing. His research interests include software testing and programming language.
Cite this article:   
Xiao-Fang Qi, Zi-Yuan Wang, Jun-Qiang Mao, Peng Wang.Automated Testing of Web Applications Using Combinatorial Strategies[J]  Journal of Computer Science and Technology, 2017,V32(1): 199-210
URL:  
http://jcst.ict.ac.cn:8080/jcst/EN/10.1007/s11390-017-1699-x
Copyright 2010 by Journal of Computer Science and Technology