Modeling Web Applications Design with Automata and Its Verification
Kei Homma, Satoru Izumi, Kaoru Takahashi, Atsushi Togashi · 2011
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.