Formal Aspects of Computing

, Volume 25, Issue 6, pp 833–846

Reasoning about orchestrations of web services using partial correctness

Open AccessOriginal Article

DOI: 10.1007/s00165-011-0212-5

Cite this article as:
Stewart, A., Gabarro, J. & Keenan, A. Form Asp Comp (2013) 25: 833. doi:10.1007/s00165-011-0212-5

Abstract

A service is a remote computational facility which is made available for general use by means of a wide-area network. Several types of service arise in practice: stateless services, shared state services and services with states which are customised for individual users. A service-based orchestration is a multi-threaded computation which invokes remote services in order to deliver results back to a user (publication). In this paper a means of specifying services and reasoning about the correctness of orchestrations over stateless services is presented. As web services are potentially unreliable the termination of even finite orchestrations cannot be guaranteed. For this reason a partial-correctness powerdomain approach is proposed to capture the semantics of recursive orchestrations.

Keywords

World Wide Web Service Specification Orchestration Orc Partial correctness Pre-orders Fixed-points Powerdomains 
Download to read the full article text

Copyright information

© British Computer Society 2011

Authors and Affiliations

  1. 1.School of EEE & Computer ScienceThe Queen’s University of BelfastBelfastNorthern Ireland, UK
  2. 2.Dep. LSIUniversitat Politècnica de CatalunyaBarcelonaSpain