By Topic

Modeling Web Applications Design with Automata and Its Verification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kei Homma ; Grad. Sch. of Project Design, Miyagi Univ., Miyagi, Japan ; Satoru Izumi ; Kaoru Takahashi ; Atsushi Togashi

The number of Web applications handling online transaction is increasing, but verification of the correctness of the Web application design has been done manually. This paper proposes a method for modeling Web applications using two finite-state automata, i.e., a page automaton which species Web page transitions, and an internal state automaton which species internal state transitions of the Web application. General assertions for checking Web application design are proposed, and a theoretical result for deadlock-freeness of Web application is also shown. An example Web application is modeled by the proposed method and checked using the model checker Spin.

Published in:

2011 Tenth International Symposium on Autonomous Decentralized Systems

Date of Conference:

23-27 March 2011