Formal Verification of Websites
Electronic Notes in Theoretical Computer Science (ENTCS)
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
Electronic Notes in Theoretical Computer Science (ENTCS)
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Semantic Verification of Web System Contents
ER '08 Proceedings of the ER 2008 Workshops (CMLSA, ECDM, FP-UML, M2AS, RIGiM, SeCoGIS, WISM) on Advances in Conceptual Modeling: Challenges and Opportunities
A fast algebraic web verification service
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Evaluating the Consistency between Navigation and Data Models for Web Applications
International Journal of Information System Modeling and Design
| Hi-index | 0.00 |
In this paper, we develop a framework for the automated verification of Web sites, which can be used to specify integrity conditions for a given Web site, and then automatically check whether these conditions are fulfilled. First, we provide a rewriting-based, formal specification language which allows us to define syntactic as well as semantic properties of the Web site. Then, we formalize a verification technique which detects both incorrect/forbidden patterns as well as lack of information, that is, incomplete/missing Web pages inside the Web site. Useful information is gathered during the verification process which can be used to repair the Web site. Our methodology is based on a novel rewriting-based technique, called partial rewriting, in which the traditional pattern matching mechanism is replaced by tree simulation, a suitable technique for recognizing patterns inside semistructured documents. The framework has been implemented in the prototype GVerdi, which is publicly available.