Modeling, Verification and Testing of Web Applications Using Model Checker

Homma, Kei; Izumi, Satoru; Takahashi, Kaoru; Togashi, Atsushi

doi:10.1587/transinf.e94.d.989

Cited by 11 publications

(8 citation statements)

References 16 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of formal, informal and semi-formal models like automata [1], state chart [2], UML and OCL [3], UML based web engineering, alloy, directed graph and control flow graphs, SDL, term rewriting systems have been proposed in literatures for modeling web applications. A methodology for the generation of concrete executable tests from abstract test cases using a test automation language, Structured Test Automation Language (STAL) was proposed in [4].…”

Section: Related Workmentioning

confidence: 99%

An Approach for Generating Concrete Test Cases Utilizing Formal Specifications of Web Applications

Bubna¹

2016

IJIEE

View full text Add to dashboard Cite

Abstract-As web applications are becoming more and more ubiquitous, modeling and testing web applications correctly is becoming necessary. This paper suggests utilizing two formal specification languages, State Chart and Z notation to describe the various functional requirements of web applications. The State chart framework is used to model the navigation behavior, while the Z notation is used to model the business logic functionality of web applications. Abstract test cases are generated from these two formal specification languages. An approach to map the abstract test cases generated from State chart model to Selenium RC JUnit concrete test case is presented in this paper. An example web application, a Hospital Management System is used to illustrate our approach.

show abstract

Section: Related Workmentioning

confidence: 99%

An Approach for Generating Concrete Test Cases Utilizing Formal Specifications of Web Applications

Bubna¹

2016

IJIEE

View full text Add to dashboard Cite

show abstract

“…For instance, [24] and [33] support the model-checking of LTL properties w.r.t. web application models that are represented as Kripke structures.…”

Section: Related Workmentioning

confidence: 99%

“…web application models that are represented as Kripke structures. In particular, [33] defines two automata, encoded in PROMELA [34], that respectively model the web application business logic and the transitions among web pages. Properties of interest are expressed as LTL formulae, and checked on the PROMELA specifications by using the SPIN model-checker [34].…”

Section: Related Workmentioning

confidence: 99%

A rewriting logic approach to the formal specification and verification of web applications

Alpuente

Ballis

Romero

2014

Science of Computer Programming

View full text Add to dashboard Cite

This paper develops a Rewriting Logic framework for the automatic specification and verification of Web applications that considers the critical aspects of concurrent Web interactions, browser navigation features (e.g., forward/backward navigation, page refresh, and new window/tab opening), and Web script evaluation. By encompassing the main features of the most popular Web scripting languages (e.g., PHP, ASP, and Java Servlets), our scripting language is powerful enough to model the dynamics of complex Web applications, where the interactions among Web servers and Web browsers are formalized through a landmark communicating protocol that abstracts HTTP. We provide a detailed characterization of browser actions via rewrite rules and show how our models can be naturally model-checked by using the Linear Temporal Logic of Rewriting (LTLR), which is a Linear Temporal Logic that is specifically designed for model-checking rewrite theories. The framework has been completely implemented in Maude, and we report on some successful experiments that we conducted using the Maude LTLR model-checker.

show abstract

“…As we have seen in the examples above, the model-checking can handle complex problems with large amounts of information, stored as a graph, in order to verify critical systems. In comparison, in the semantic web, the use of graphs is pervasive and serious problems of scalability arise [5]. Thus, it is appropriate to use the algorithms developed for model-checking to the field of Semantic Web.…”

Section: W3cmentioning

confidence: 99%

Qualifying semantic graphs using model checking

Gueffaz

Rampacek

Nicolle

2011

2011 International Conference on Innovations in Information Technology

View full text Add to dashboard Cite

Abstract-Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and metainformation has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns the adaptation of model checking techniques to semantic graphs. In this paper, we present a first method of converting RDF graphs into NμSMV and PROMELA languages.

show abstract

Modeling, Verification and Testing of Web Applications Using Model Checker

Cited by 11 publications

References 16 publications

An Approach for Generating Concrete Test Cases Utilizing Formal Specifications of Web Applications

An Approach for Generating Concrete Test Cases Utilizing Formal Specifications of Web Applications

A rewriting logic approach to the formal specification and verification of web applications

Qualifying semantic graphs using model checking

Contact Info

Product

Resources

About