Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).

View the beta site
NIST logo

Publication Citation: A Combinatorial Approach to Building Navigation Graphs for Dynamic Web Applications

NIST Authors in Bold

Author(s): Raghu N. Kacker; David R. Kuhn; James F. Lawrence; Wenhua Wang; Yu Lei; Sreedevi Sampath;
Title: A Combinatorial Approach to Building Navigation Graphs for Dynamic Web Applications
Published: September 20, 2009
Abstract: Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt with: (1) the page explosion problem, i.e., the number of dynamic pages may be huge or even infinite; and (2) the request generation problem, i.e., many dynamic pages may not be reached unless appropriate user requests are supplied. As a user request typically consists of multiple parameter values, the request generation problem can be further divided into two problems: (1) How to select appropriate values for individual parameters? (2) How to effectively combine individual parameter values to generate requests? This paper presents a combinatorial approach to building a navigation graph. We report a prototype tool called Tansuo, and apply the tool to five open source web applications. Our empirical results indicate that Tansuo can efficiently generate web navigation graphs for these applications.
Conference: Proceedings of ICSM
Proceedings: 25th IEEE International Conference on Software Maintenance (ICSM)
Pages: pp. 211 - 220
Location: Edmonton, -1
Dates: September 20-26, 2009
Keywords: combinatorial testing, navigation graphs, software testing, web application testing
Research Areas: Math, Modeling
PDF version: PDF Document Click here to retrieve PDF version of paper (264KB)