Using combinatorial testing to build navigation graphs for dynamic web applications

Abstract

Summary Modelling a software system is often a challenging prerequisite to automatic test case generation. Modelling the navigation structure of a dynamic web application is particularly challenging because of the presence of a large number of pages that are created dynamically and the difficulty of reaching a dynamic page unless a set of appropriate input values are provided for the parameters. To address the first challenge, some form of abstraction is required to enable scalable modelling. For the second challenge, techniques are required to select appropriate input values for parameters and systematically combine them to reach new pages. This paper presents a combinatorial approach in building a navigation graph for dynamic web applications. The navigation graph can then be used to automatically generate test sequences for testing web applications. The novelty of our approach is twofold. First, we use an abstraction scheme to control the page explosion problem, where pages that are likely to have the same navigation behaviour are grouped together and are represented as a single node in the navigation graph. Second, assuming that values of individual parameters are supplied manually or generated from other techniques, we combine parameter values such that well‐defined combinatorial coverage of input parameter values is achieved. Using combinatorial coverage can significantly reduce the number of requests that have to be submitted while still achieving effective coverage of the navigation structure. We implement our combinatorial approach in a tool, Tansuo, and apply the tool on seven open‐source web applications. We evaluate the effectiveness of Tansuo's exploration process guided by t‐way coverage, for t = 1,2,3, with respect to code coverage, and find that the navigation structure exploration by Tansuo, in general, results in high code coverage (more than 80% statement coverage for most of our subject applications when dead code is removed). We compare Tansuo's effectiveness with two other navigation graph tools and find that Tansuo is more effective. Our empirical results indicate that using pairwise coverage in Tansuo results in the efficient generation of navigation graphs and effective exploration of dynamic web applications. Copyright © 2016 John Wiley & Sons, Ltd.

A Clustering-Based Approach to Identifying Potential Output Anomalies with Combinatorial Testing for Web Applications

“…Combinatorial testing has been applied to be used to test web applications. This includes web security [11,12], additionally, it has also been used to build automated models for dynamic explorations of a website [13,14].…”

Constructing Test Suites for Real-Time Embedded Systems Under Input Timing Constraints

“…CT [41]- [44] is an efficient testing method through which an optimal or near optimal test suite with fewer test cases and high fault detection rate [45] can be designed or generated. CT has been successfully applied to many non-real time different domains, such as GUI [46], Web applications [47], database [48] and system hardware design flaw analysis of the Lockheed Martin F-16 ventral fin [49]. In case of real-time systems, NCAs has been used in the Automatic Block Signal System (ABSS) for preventing rear-end collision of high speed trains [13].…”

Optimum Design of PIλDμ Controller for an Automatic Voltage Regulator System Using Combinatorial Test Design

“…For example, Cohen et al [1] apply this technique successfully to test configurable software systems in the presence of constraints. Wang et al [2] use this technique to build navigation graphs for dynamic web applications. Wang et al [3] also used it for security systems to detect buffer overflow vulnerabilities.…”