Dependence graphs for verifications of web service compositions with PEWS

Authors:
Cheikh Ba;Mírian Halfeld Ferrari
Affiliations:
Université François Rabelais de Tours, Blois, France;Université François Rabelais de Tours, Blois, France
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 4
Cited 2

Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Predicate path expressions

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Web service interfaces

WWW '05 Proceedings of the 14th international conference on World Wide Web
Composing Web Services with PEWS: A Trace-Theoretical Approach

ECOWS '06 Proceedings of the European Conference on Web Services

A programming environment for web services

Proceedings of the 2008 ACM symposium on Applied computing
PEWS platform: a web services composition environment

Proceedings of the 6th International Workshop on Enhanced Web Service Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

PEWS is an interface description language for both individual and composed web services. We propose an approach for verifying PEWS compositions which exploits dependence graphs (equivalent to trace systems). The introduction of a synchronization based on dependence graphs allows more efficient algorithms for testing composition properties.