A well-founded approach to service modelling with Casl4Soa: part 1 (service in isolation)
Proceedings of the 2010 ACM Symposium on Applied Computing
Runtime verification for the web: a tutorial introduction to interface contracts in web applications
RV'10 Proceedings of the First international conference on Runtime verification
Automated generation of web service stubs using LTL satisfiability solving
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
A logical approach to data-aware automated sequence generation
Transactions on Computational Science XV
Specification patterns from research to industry: a case study in service-based applications
Proceedings of the 34th International Conference on Software Engineering
Runtime verification of data-centric properties in service based systems
RV'11 Proceedings of the Second international conference on Runtime verification
Specification and monitoring of data-centric temporal properties for service-based systems
Journal of Systems and Software
Runtime verification of service-oriented systems: a well-rounded survey
International Journal of Web and Grid Services
Hi-index | 0.00 |
Most works that extend workflow validation beyond syntactical checking consider constraints on the sequence of messages exchanged between services. These constraints are expressed only in terms of message names and abstract away their actual data content. We provide examples of real-world “data-aware” Web service constraints where the sequence of messages and their content are interdependent. To this end, we present {\rm CTL}\hbox{-}{\rm FO}^+, an extension over Computation Tree Logic that includes first-order quantification on message content in addition to temporal operators. We show how {\rm CTL}\hbox{-}{\rm FO}^+ is adequate for expressing data-aware constraints, give a sound and complete model checking algorithm for {\rm CTL}\hbox{-}{\rm FO}^+, and establish its complexity to be PSPACE-complete. A “naive” translation of {\rm CTL}\hbox{-}{\rm FO}^+ into CTL leads to a serious exponential blowup of the problem that prevents existing validation tools to be used. We provide an alternate translation of {\rm CTL}\hbox{-}{\rm FO}^+ into CTL, where the construction of the workflow model depends on the property to validate. We show experimentally how this translation is significantly more efficient for complex formulas and makes model checking of data-aware temporal properties on real-world Web service workflows tractable using off-the-shelf tools.