Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions

Authors:
Luciano Baresi;Domenico Bianculli;Sam Guinea;Paola Spoletini
Affiliations:
Politecnico di Milano - DEEP-SE Group - DEI, Milano, Italy;Faculty of Informatics, University of Lugano, Lugano, Switzerland;Politecnico di Milano - DEEP-SE Group - DEI, Milano, Italy;Università dell'Insubria - DSCPI, Como, Italy
Venue:
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Year:
2009

Citing 7
Cited 1

An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Alternation

Journal of the ACM (JACM)
Statistically rigorous java performance evaluation

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Efficient online monitoring of web-service SLAs

Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Property Patterns for Runtime Monitoring of Web Service Conversations

Runtime Verification
A Guided Tour through SAVVY-WS: A Methodology for Specifying and Validating Web Service Compositions

Advances in Software Engineering
Monitoring of real-time properties

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science

A developer-friendly approach for the validation of dynamic compositions

SAM'10 Proceedings of the 6th international conference on System analysis and modeling: about models

Quantified Score

Hi-index	0.00

Visualization

Abstract

Service compositions leverage remote services to deliver added-value distributed applications. Since services are administered and run by independent parties, the governance of service compositions is intrinsically decentralized and services may evolve independently over time. In this context, pre-deployment verification can only provide limited guarantees, while continuous run-time verification is needed to probe and guarantee the correctness of compositions at run time. This paper addresses the issue of efficiency in the run-time verification of service compositions described in BPEL. It considers an existing monitoring approach based on ALBERT, which is a temporal logic language suitable for asserting both functional and non-functional properties, and shows how to obtain the efficient run-time verification of ALBERT formulae. The paper introduces an operational semantics for ALBERT through an extension of alternating automata, and explains how to optimize it to produce smarter, and thus more efficient, encodings of defined formulae. The optimized operational semantics can then be the basis for an efficient implementation of the run-time verification framework.