Modeling web applications design with automata and its verification

Kei Homma; Satoru Izumi; Kaoru Takahashi; Atsushi Togashi

doi:10.1109/ISADS.2011.108

Modeling web applications design with automata and its verification

Kei Homma, Satoru Izumi, Kaoru Takahashi, Atsushi Togashi

Information Sciences (department affiliation only)

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011
Pages	103-112
Number of pages	10
DOIs	https://doi.org/10.1109/ISADS.2011.108
Publication status	Published - 2011
Event	2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011 - Tokyo and Hiroshima, Japan Duration: 2011 Mar 23 → 2011 Mar 27

Publication series

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

Other

Other	2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011
Country/Territory	Japan
City	Tokyo and Hiroshima
Period	11/3/23 → 11/3/27

Keywords

Automata
Formal approach
Model checking
Spin
Web application

ASJC Scopus subject areas

Artificial Intelligence
Control and Systems Engineering

Access to Document

10.1109/ISADS.2011.108

Cite this

Homma, K., Izumi, S., Takahashi, K., & Togashi, A. (2011). Modeling web applications design with automata and its verification. In Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011 (pp. 103-112). [5741286] (Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011). https://doi.org/10.1109/ISADS.2011.108

Modeling web applications design with automata and its verification. / Homma, Kei; Izumi, Satoru; Takahashi, Kaoru et al.

Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011. 2011. p. 103-112 5741286 (Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Homma, K, Izumi, S, Takahashi, K & Togashi, A 2011, Modeling web applications design with automata and its verification. in Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011., 5741286, Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011, pp. 103-112, 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011, Tokyo and Hiroshima, Japan, 11/3/23. https://doi.org/10.1109/ISADS.2011.108

@inproceedings{b66a684de0ba4de5af2aaca31b57be2b,

title = "Modeling web applications design with automata and its verification",

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.",

keywords = "Automata, Formal approach, Model checking, Spin, Web application",

author = "Kei Homma and Satoru Izumi and Kaoru Takahashi and Atsushi Togashi",

note = "Copyright: Copyright 2011 Elsevier B.V., All rights reserved.; 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011 ; Conference date: 23-03-2011 Through 27-03-2011",

year = "2011",

doi = "10.1109/ISADS.2011.108",

language = "English",

isbn = "9780769543499",

series = "Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011",

pages = "103--112",

booktitle = "Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011",

}

TY - GEN

T1 - Modeling web applications design with automata and its verification

AU - Homma, Kei

AU - Izumi, Satoru

AU - Takahashi, Kaoru

AU - Togashi, Atsushi

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Automata

KW - Formal approach

KW - Model checking

KW - Spin

KW - Web application

UR - http://www.scopus.com/inward/record.url?scp=79955716410&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955716410&partnerID=8YFLogxK

U2 - 10.1109/ISADS.2011.108

DO - 10.1109/ISADS.2011.108

M3 - Conference contribution

AN - SCOPUS:79955716410

SN - 9780769543499

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

SP - 103

EP - 112

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

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

Y2 - 23 March 2011 through 27 March 2011

ER -

Modeling web applications design with automata and its verification

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this