The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Model Checking the World Wide Web
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Higher-Order and Symbolic Computation
Modeling and verification of adaptive navigation in web applications
ICWE '06 Proceedings of the 6th international conference on Web engineering
Model Checking-based Verification of Web Application
ICECCS '07 Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems
Formal Verification of Websites
Electronic Notes in Theoretical Computer Science (ENTCS)
Controlling Control Flow in Web Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Specification Patterns for Formal Web Verification
ICWE '08 Proceedings of the 2008 Eighth International Conference on Web Engineering
A Model Checking-based Method for Verifying Web Application Design
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOP'03 Proceedings of the 12th European conference on Programming
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-checking web applications with web-TLR
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Backward trace slicing for rewriting logic theories
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Backward trace slicing for conditional rewrite theories
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using conditional trace slicing for improving Maude programs
Science of Computer Programming
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
Hi-index | 0.00 |
This paper presents a Rewriting Logic framework that formalizes the interactions between Web servers and Web browsers through a communicating protocol abstracting HTTP. The proposed framework includes a scripting language that is powerful enough to model the dynamics of complex Web applications by encompassing the main features of the most popular Web scripting languages (e.g. PHP, ASP, Java Servlets). We also provide a detailed characterization of browser actions (e.g. forward/backward navigation, page refresh, and new window/tab openings) 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 specifically designed for model-checking rewrite theories. Our formalization is particularly suitable for verification purposes, since it allows one to perform in-depth analyses of many subtle aspects related to Web interaction. Finally, the framework has been completely implemented in Maude, and we report on some successful experiments that we conducted by using the Maude LTLR model-checker.