Analysis of composite web services using logging facilities

Authors:
Mohsen Rouached;Claude Godart
Affiliations:
LORIA, INRIA, UMR, Vandoeuvre-les-Nancy Cedex, France;LORIA, INRIA, UMR, Vandoeuvre-les-Nancy Cedex, France
Venue:
ICSOC'06 Proceedings of the 4th international conference on Service-oriented computing
Year:
2006

Citing 8
Cited 0

A logic-based calculus of events

New Generation Computing
A general framework to build contextual cover set

Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Verification of Web Service Flows with Model-Checking Techniques

CW '02 Proceedings of the First International Symposium on Cyber Worlds (CW'02)
Analysis of interacting BPEL web services

Proceedings of the 13th international conference on World Wide Web
Compatibility Verification for Web Service Choreography

ICWS '04 Proceedings of the IEEE International Conference on Web Services
Towards formal verification of web service composition

BPM'06 Proceedings of the 4th international conference on Business Process Management
A contract-based approach for monitoring collaborative web services using commitments in the event calculus

WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Web service mining and verification of properties: an approach based on event calculus

ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to fully explore Web service business opportunities while ensuring a correct and reliable modelling and execution, analyzing and tracking Web services interactions will enable them to be well understood and controlled. This paper advocates a novel technique to log composite Web services and a formal approach, based on an algebraic specification of the discrete event calculus language DEC, to check behavioural properties of composite Web services regarding their execution log. An automated induction-based theorem prover SPIKE is used as verification back-end.