Scalability issues with using FSMWeb to test web applications |
| |
| Authors: | Anneliese A. Andrews Jeff Offutt Curtis Dyreson Christopher J. Mallery Kshamta Jerath Roger Alexander |
| |
| Affiliation: | 1. Professor and Associate Dean, University of Denver, 360 S. Gaylord Street, JGH 116, Denver, CO 80208, USA;2. Software Engineering, Volgenau School of Information Technology and Engineering, George Mason University, Fairfax, VA 22030, USA;3. School of EE and CS, Washington State University, Pullman, WA 99164, USA;4. Schweitzer Engineering Laboratories, Inc. Pullman, Washington 99163, USA;1. Department of Pharmacy, University of Peshawar-25120, Peshawar, Pakistan;2. Department of Pharmacy, University of Peshawar-25120, Peshawar, Pakistan;3. Gandhara College of Pharmacy, Gandhara University, Peshawar, Pakistan;1. The Key Laboratory of Intelligent Perception and Image Understanding of the Ministry of Education, International Research Center for Intelligent Perception and Computation, Xidian University, Xi''an Shaanxi Province 710071, China;2. The School of Computer Science and Technology and also with the Key Laboratory of Intelligent Perception and Image Understanding of the Ministry of Education, International Research Center for Intelligent Perception and Computation, Xidian University, Xi''an Shaanxi Province 710071, China;1. School of Civil Engineering, Universiti Teknologi Malaysia, 81310, Johor, Malaysia;2. Department of Civil and Environmental Engineering, Universiti Teknologi PETRONAS, 32610, Perak, Malaysia;3. Department of Environmental Sciences, COMSATS University Islamabad, Abbottabad Campus, Pakistan |
| |
| Abstract: | Web applications are fast becoming more widespread, larger, more interactive, and more essential to the international use of computers. It is well understood that web applications must be highly dependable, and as a field we are just now beginning to understand how to model and test Web applications. One straightforward technique is to model Web applications as finite state machines. However, large numbers of input fields, input choices and the ability to enter values in any order combine to create a state space explosion problem. This paper evaluates a solution that uses constraints on the inputs to reduce the number of transitions, thus compressing the FSM. The paper presents an analysis of the potential savings of the compression technique and reports actual savings from two case studies. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
