Thesis
On the feasibility of using FSM approaches to test large web applications
Washington State University
Master of Science (MS), Washington State University
2005
Handle:
https://hdl.handle.net/2376/309
Abstract
Today’s world economy demands that both market access and customer service be available anytime and anywhere. The Web is the only way to supply global economic needs and, due to expanded development of comprehensive web applications, it does so relatively inexpensively. The ability of web applications to provide a relatively inexpensive way to deploy customer services, which are available anywhere at any time, has created a demand for high quality web applications. How to model and test them is a relatively new field of research. 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 thesis evaluates a solution that uses constraints on the inputs to reduce the number of transitions, in addition to partitioning a single finite state machine into a hierarchy of smaller finite state machines, thus compressing the model. It analyzes the potential savings of this technique through an analytical analysis and the results of two simulation experiments. It also reports the actual savings found from five case studies.
Metrics
8 File views/ downloads
10 Record Views
Details
- Title
- On the feasibility of using FSM approaches to test large web applications
- Creators
- Christopher Jerry Mallery
- Contributors
- Anneliese Andrews (Degree Supervisor)
- Awarding Institution
- Washington State University
- Academic Unit
- Electrical Engineering and Computer Science, School of
- Theses and Dissertations
- Master of Science (MS), Washington State University
- Publisher
- Washington State University; [Pullman, Washington] :
- Identifiers
- 99900525132801842
- Language
- English
- Resource Type
- Thesis