Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
PROPEL: an approach supporting property elucidation
Proceedings of the 24th International Conference on Software Engineering
Formal Framework for Automated Analysis and Verification of Web-Based Applications
Proceedings of the 19th IEEE international conference on Automated software engineering
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
The definition of a temporal clock operator
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Testing in context: framework and test derivation
Computer Communications
Formal Verification of Websites
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while others - only a proper subset of them. To be able to discriminate states of interest in the state space, we solve the problem of property specification in LTL over a subset of states of a system under test while ignoring the valuation of the properties in the rest of them. We introduce specialized operators that facilitate specifying properties over propositional scopes, where each scope constitutes a subset of states that satisfy a propositional logic formula. Using the proposed operators, the user can specify web properties more concisely and intuitively. We illustrate the proposed solution in specifying properties of web applications and discuss other potential applications.