Automated Testing of Web Applications Using Combinatorial Strategies

详细信息    查看全文

• 作者：Xiao-Fang Qi ; Zi-Yuan Wang ; Jun-Qiang Mao…
• 关键词：automated testing ; combinatorial testing ; web application
• 刊名：Journal of Computer Science and Technology
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：32
• 期：1
• 页码：199-210
• 全文大小：
• 刊物类别：Computer Science
• 刊物主题：Computer Science, general; Software Engineering; Theory of Computation; Data Structures, Cryptology and Information Theory; Artificial Intelligence (incl. Robotics); Information Systems Applications (
• 出版者：Springer US
• ISSN：1860-4749
• 卷排序：32

文摘

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.