Web applications often use dynamic pages that interact with each other by accessing shared objects, e.g., session objects. Interactions between dynamic pages need to be carefully tested, as they may give rise to subtle faults that cannot be detected by testing individual pages in isolation. Since it is impractical to test all possible interactions, a trade-off must be made between test coverage (in terms of number of interactions covered in the tests) and test effort. In this paper, we present a test sequence generation approach to cover all pairwise interactions, i.e., interactions between any two pages. Intuitively, if a page P could reach another page P , there must exist a test sequence in which both P and P are visited in the given order. We report a test sequence generation algorithm and two case studies in which test sequences are generated to achieve pairwise interaction coverage for two web applications.
Proceedings Title: 11th IEEE High Assurance Systems Engineering Symposium
Conference Dates: December 2-5, 2008
Conference Location: Nanjing, MD
Pub Type: Conferences
combinatorial testing, testing web applications