Dependence graphs for verifications of web service compositions with PEWS

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Dependence graphs for verifications of web service compositions with PEWS

Full text

Pdf (230 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2008 ACM symposium on Applied computing table of contents

Fortaleza, Ceara, Brazil

SESSION: Web technologies table of contents

Pages 2387-2391

Year of Publication: 2008

ISBN:978-1-59593-753-7

Authors

Cheikh Ba	Université François Rabelais de Tours, Blois, France
Mírian Halfeld Ferrari	Université François Rabelais de Tours, Blois, France

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 65, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1363686.1364253 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Sten Andler, Predicate path expressions, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.226-236, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567774]
	2	C. Ba, M. Carrero, M. Halfeld Ferrari, and M. Musicante. PEWS: A new language for building web service interfaces. Journal of Universal Computer Science, 11(7):1215--1233, July 2005. http://www.jucs.org/jucs_11_7/pews_a_new_language.
	3	Cheikh Ba , Mirian Halfeld Ferrari , Martin A. Musicante, Composing Web Services with PEWS: A Trace-Theoretical Approach, Proceedings of the European Conference on Web Services, p.65-74, December 04-06, 2006 [doi>10.1109/ECOWS.2006.12]
	4	Boualem Benatallah, Fabio Casati, Julien Ponge, and Farouk Toumani. Compatibility and replaceability analysis for timed web services protocols. Bases de données avancées (BDA), 2005.
	5	Dirk Beyer , Arindam Chakrabarti , Thomas A. Henzinger, Web service interfaces, Proceedings of the 14th international conference on World Wide Web, May 10-14, 2005, Chiba, Japan [doi>10.1145/1060745.1060770]
	6	Luca de Alfaro , Thomas A. Henzinger, Interface automata, Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering, September 10-14, 2001, Vienna, Austria
	7	Hendrik Jan Hoogeboom and Grzegorz Rozenberg. Dependence graphs. In Volker Diekert and Grzegorz Rozenberg, editors, The Book of Traces. World Scientific, 1995.
	8	Antoni Mazurkiewicz. Trace theory. Number 255 in Lecture Notes in Computer Science (LNCS). Springer-Verlag, 1987.