The number of Web applications handling online transaction is increasing, but verification of the correctness of Web application development has been done manually. This paper proposes a method for modeling, verifying and testing Web applications. In our method, a Web application is modeled 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 properties for checking the Web application design are presented in LTL formulae and they are verified using the model checker Spin. Test cases examining the behavior of the Web application are also generated by utilizing the counterexamples obtained as the result of model checking. We applied our method to an example Web application to confirm its effectiveness.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kei HOMMA, Satoru IZUMI, Kaoru TAKAHASHI, Atsushi TOGASHI, "Modeling, Verification and Testing of Web Applications Using Model Checker" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 5, pp. 989-999, May 2011, doi: 10.1587/transinf.E94.D.989.
Abstract: The number of Web applications handling online transaction is increasing, but verification of the correctness of Web application development has been done manually. This paper proposes a method for modeling, verifying and testing Web applications. In our method, a Web application is modeled 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 properties for checking the Web application design are presented in LTL formulae and they are verified using the model checker Spin. Test cases examining the behavior of the Web application are also generated by utilizing the counterexamples obtained as the result of model checking. We applied our method to an example Web application to confirm its effectiveness.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.989/_p
Copy
@ARTICLE{e94-d_5_989,
author={Kei HOMMA, Satoru IZUMI, Kaoru TAKAHASHI, Atsushi TOGASHI, },
journal={IEICE TRANSACTIONS on Information},
title={Modeling, Verification and Testing of Web Applications Using Model Checker},
year={2011},
volume={E94-D},
number={5},
pages={989-999},
abstract={The number of Web applications handling online transaction is increasing, but verification of the correctness of Web application development has been done manually. This paper proposes a method for modeling, verifying and testing Web applications. In our method, a Web application is modeled 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 properties for checking the Web application design are presented in LTL formulae and they are verified using the model checker Spin. Test cases examining the behavior of the Web application are also generated by utilizing the counterexamples obtained as the result of model checking. We applied our method to an example Web application to confirm its effectiveness.},
keywords={},
doi={10.1587/transinf.E94.D.989},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - Modeling, Verification and Testing of Web Applications Using Model Checker
T2 - IEICE TRANSACTIONS on Information
SP - 989
EP - 999
AU - Kei HOMMA
AU - Satoru IZUMI
AU - Kaoru TAKAHASHI
AU - Atsushi TOGASHI
PY - 2011
DO - 10.1587/transinf.E94.D.989
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2011
AB - The number of Web applications handling online transaction is increasing, but verification of the correctness of Web application development has been done manually. This paper proposes a method for modeling, verifying and testing Web applications. In our method, a Web application is modeled 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 properties for checking the Web application design are presented in LTL formulae and they are verified using the model checker Spin. Test cases examining the behavior of the Web application are also generated by utilizing the counterexamples obtained as the result of model checking. We applied our method to an example Web application to confirm its effectiveness.
ER -