Validation of web service compositions

被引:55
作者
Baresi, L. [1 ]
Bianculli, D. [2 ]
Ghezzi, C. [1 ]
Guinea, S. [1 ]
Spoletini, P. [1 ]
机构
[1] Politecn Milan, Dipartimento Elettr & Informat, DEEP SE Grp, I-20133 Milan, Italy
[2] Univ Lugano, Fac Informat, CH-6900 Lugano, Switzerland
关键词
D O I
10.1049/iet-sen:20070027
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Web services support software architectures that can evolve dynamically. In particular, in this paper the focus is on architectures where services are composed (orchestrated) through a workflow described in the business process execution language (BPEL). It is assumed that the resulting composite service refers to external services through assertions that specify their expected functional and non-functional properties. On the basis of these assertions, the composite service may be verified at design time by checking that it ensures certain relevant properties. Because of the dynamic nature of web services and the multiple stakeholders involved in their provision, however, the external services may evolve dynamically, and even unexpectedly. They may become inconsistent with respect to the assertions against which the workflow was verified during development. As a consequence, validation of the composition must extend to run time. In this work, an assertion language, called assertion language for BPEL process interactions (ALBERT), is introduced; it can be used to specify both functional and non-functional properties. An environment which supports design-time verification of ALBERT assertions for BPEL workflows via model checking is also described. At run time, the assertions can be turned into checks that a software monitor performs on the composite system to verify that it continues to guarantee its required properties. A TeleAssistance application is provided as a running example to illustrate our validation framework.
引用
收藏
页码:219 / 232
页数:14
相关论文
共 36 条
[1]  
Andrews Tony, 2003, Business process execution language for web services
[2]  
[Anonymous], P INT WORKSH SOFTW P
[3]  
Barbon F, 2006, ICWS 2006: IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS, P63
[4]  
Baresi L, 2006, LECT NOTES COMPUT SC, V4229, P131
[5]   Toward open-world software: Issues and challenges [J].
Baresi, Luciano ;
Di Nitto, Ellsabetta ;
Ghezzi, Carlo .
COMPUTER, 2006, 39 (10) :36-+
[6]  
BIANCULLI D, 2007, P 2007 IEEE INT C SE, P13
[7]  
Clarke Edmund, 2000, Computer Aided Verification, P154, DOI [10.1007/10722167_15, DOI 10.1007/10722167_15]
[8]  
Clarke EM, 1999, MODEL CHECKING, P1
[9]   THE CONCURRENCY WORKBENCH - A SEMANTICS-BASED TOOL FOR THE VERIFICATION OF CONCURRENT SYSTEMS [J].
CLEAVELAND, R ;
PARROW, J ;
STEFFEN, B .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1993, 15 (01) :36-72
[10]  
Colombo M, 2006, LECT NOTES COMPUT SC, V4294, P191