Eugenio Di Sciascio
Francesco M. Donini
ABSTRACT
In this paper we propose a formal method for web applications verification. The verification process is carried out by checking that either the system always satisfies a model of the specifications or by producing a counter-example.We represent the system as a Kripke structure and model a web site as a graph. Model checking is reformulated as checking that each initial state satisfies the specifications. We adopt Computation Tree Logic (CTL) as language to define the properties to be verified.The proposed formal method has been deployed in AnWeb, a tool for automatic support in the design of web applications. The tool provides an interface to the SMV model checker. The system parses the HTML source code of web pages, including code for dynamic pages, builds the model in SMV input language and provides the proper CTL specifications to the SMV tool.
- R. Bryant. Graph based algorithms for boolean function manipulation. IEEE Computer, 35(8):677-691, 1986.]] Google Scholar
Digital Library
- R. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.]] Google ScholarDigital Library
- A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NUSMV: a new Symbolic Model Verifier. In N. Halbwachs and D. Peled, editors, Proceedings of the Eleventh International Conference on Computer Aided Verification (CAV'99), number 1633 in Lecture Notes in Computer Science, pages 495-499, Trento, Italy, July 1999. Springer.]] Google ScholarDigital Library
- E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.]] Google ScholarDigital Library
- J. Conallen. Modelling web applications architectures with UML. Communications of the ACM, 42(10):63-70, 1999.]] Google ScholarDigital Library
- L. de Alfaro. Model checking the World Wide Web. In Proceedings of the 13th International Conference on Computer Aided Verification (CAV'01), pages 77-85, 2001.]] Google ScholarDigital Library
- E. Di Sciascio, F. Donini, M. Mongiello, and G. Piscitelli. Verifying integrity constraints on web-based systems using model checking. In Atti del XXXIX Congresso dell'Associazione Italiana per il Calcolo Automatico AICA 01, September 2001.]]Google Scholar
- M. Huth and M. Ryan. Logic in Computer Science. Cambridge University Press, 1999.]]Google Scholar
- K. L. McMillan. The SMV system, February 1992. http://www.cs.cmu.edu/modelcheck/smv/smvmanual.r2.2.ps.]]Google Scholar
- F. Ricca and P. Tonella. Web site analysis: structure and evolution. In Proceedings of the IEEE International Conference on Software Maintenance (ICSM'00), pages 76-86, San Jose, California, 2000.]] Google ScholarDigital Library
- P. Stotts and J. Furuta. Hyperdocuments as automata: verification of trace-based browsing properties by model checking. ACM Transactions on Information Systems, 16(1):1-30, 1998.]] Google ScholarDigital Library
Index Terms
- AnWeb: a system for automatic support to web application verification
Recommendations
Logics and translations for hierarchical model checking
In this study, logics and translations for hierarchical model checking are developed based on linear-time temporal logic (LTL) and computation-tree logic (CTL). Hierarchical model checking is a model checking paradigm that can appropriately verify ...
Computation tree logic model checking based on possibility measures
In order to deal with the systematic verification with uncertain information in possibility theory, Li and Li (2013) introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue, Lei and Li (2011) ...
Robust Computation Tree Logic
NASA Formal MethodsAbstractIt is widely accepted that every system should be robust in that “small” violations of environment assumptions should lead to “small” violations of system guarantees, but it is less clear how to make this intuition mathematically precise. While ...
Comments