Invariant-Based Automatic Testing of AJAX User Interfaces

被引:92
作者
Mesbah, Ali [1 ]
van Deursen, Arie [1 ]
机构
[1] Delft Univ Technol, Software Engn Res Grp, NL-2600 AA Delft, Netherlands
来源
2009 31ST INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS | 2009年
关键词
D O I
10.1109/ICSE.2009.5070522
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
AJAX-based Web 2.0 applications rely on stateful asynchronous client/server communication, and client-side runtime manipulation of the DOM tree. This not only makes them fundamentally different from traditional web applications, but also more error-prone and harder to test. We propose a method for testing AJAX applications automatically, based on a crawler to infer a flow graph for all (client-side) user interface states. We identify AJAX-specific faults that can occur in such states (related to DOM validity, error messages, discoverability, back-button compatibility, etc.) as well as DOM-tree invariants that can serve as oracle to detect such faults. We implemented our approach in ATUSA, a tool offering generic invariant checking components, a plugin-mechanism to add application specific state validators, and generation of a test suite covering the paths obtained during crawling. We describe two case studies evaluating the fault revealing capabilities, scalability required manual effort and level of automation of our approach.
引用
收藏
页码:210 / 220
页数:11
相关论文
共 26 条
[21]   Automated oracle comparators for testing web applications [J].
Sprenkle, Sara ;
Pollock, Lori ;
Esquivel, Holly ;
Hazelwood, Barbara ;
Ecott, Stacey .
ISSRE 2007: 18TH IEEE INTERNATIONAL SYMPOSIUM ON SOFTWARE RELIABILITY ENGINEERING, PROCEEDINGS, 2007, :117-+
[22]  
Sprenkle Sara., 2005, AUTOMAT SOFTW ENG, P253, DOI DOI 10.1145/1101908.1101947
[23]   Framework testing of web applications using TTCN-3 [J].
Stepien B. ;
Peyton L. ;
Xiong P. .
International Journal on Software Tools for Technology Transfer, 2008, 10 (4) :371-381
[24]   ON TESTING NON-TESTABLE PROGRAMS [J].
WEYUKER, EJ .
COMPUTER JOURNAL, 1982, 25 (04) :465-470
[25]   FINDING K SHORTEST LOOPLESS PATHS IN A NETWORK [J].
YEN, JY .
MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (11) :712-716
[26]  
Yin R. K., 2003, Qualitative research from start to finish