Modeling web applications design with automata and its verification

Kei Homma, Satoru Izumi, Kaoru Takahashi, Atsushi Togashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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 specifies Web page transitions, and an internal state automaton which specifies 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.

Original languageEnglish
Title of host publicationProceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011
Pages103-112
Number of pages10
DOIs
Publication statusPublished - 2011
Event2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011 - Tokyo and Hiroshima, Japan
Duration: 2011 Mar 232011 Mar 27

Publication series

NameProceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011

Other

Other2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011
Country/TerritoryJapan
CityTokyo and Hiroshima
Period11/3/2311/3/27

Keywords

  • Automata
  • Formal approach
  • Model checking
  • Spin
  • Web application

ASJC Scopus subject areas

  • Artificial Intelligence
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Modeling web applications design with automata and its verification'. Together they form a unique fingerprint.

Cite this