The Rely/Guarantee Approach to Verifying Concurrent BPEL Programs

Web services have become more and more important in these years, and BPEL4WS (BPEL) is the OASIS standard for web services composition and orchestration. It contains several distinct features, including scope-based compensation and fault handling mechanism. This paper focuses on the verification of BPEL programs, especially the verification of concurrent BPEL programs. The rely/guarantee approach is applied. Firstly, we present the operational semantics for BPEL programs. Secondly we apply the rely/guarantee method in the design of the verification rules. The rules can handle the features of BPEL programs, including compensation, fault handling and concurrency. Finally, the whole proof system is proved to be sound based on our operational semantics.

[1]  Willem P. de Roever,et al.  A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..

[2]  Shengchao Qin,et al.  Verifying BPEL-Like Programs with Hoare Logic , 2008, TASE.

[3]  Roberto Bruni,et al.  Theoretical foundations for compensations in flow composition languages , 2005, POPL '05.

[4]  Richard Banach,et al.  Book Review: "Concurrency Verification: Introduction to Compositional and Non-compositional Methods" by Willem-Paul de Roever, Frank de Boer, Ulrich Hanneman, Jozef Hooman, Yassine Lakhnech, Mannes Poel and Job Zwiers (eds.) , 2003, J. Log. Comput..

[5]  Roberto Bruni,et al.  From Theory to Practice in Transactional Composition of Web Services , 2005, EPEW/WS-FM.

[6]  Michael J. Butler,et al.  An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions , 2004, COORDINATION.

[7]  Mario Bravetti,et al.  Formal Techniques for Computer Systems and Business Processes, European Performance Engineering Workshop, EPEW 2005 and International Workshop on Web Services and Formal Methods, WS-FM 2005, Versailles, France, September 1-3, 2005, Proceedings , 2005, EPEW/WS-FM.

[8]  H McCarrick,et al.  The first 25 years , 1973, Nursing times.

[9]  Michael J. Butler,et al.  Precise Modelling of Compensating Business Transactions and its Application to BPEL , 2005, J. Univers. Comput. Sci..

[10]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[11]  C. A. R. Hoare,et al.  A Trace Semantics for Long-Running Transactions , 2004, 25 Years Communicating Sequential Processes.

[12]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[13]  E. B. Moss,et al.  Nested Transactions: An Approach to Reliable Distributed Computing , 1985 .

[14]  Cliff B. Jones,et al.  Tentative steps toward a development method for interfering programs , 1983, TOPL.

[15]  Jane Hillston,et al.  Challenges for Quantitative Analysis of Collective Adaptive Systems , 2013, TGC.

[16]  Paolo Milazzo,et al.  Design and verification of long-running transactions in a timed framework , 2008, Sci. Comput. Program..

[17]  Cosimo Laneve,et al.  web-pi at Work , 2005, TGC.

[18]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[19]  Frank Leymann.  Web Services and Their Composition , 2001, EWSPT.

[20]  Willem P. de Roever,et al.  The rely-guarantee method for verifying shared variable concurrent programs , 1997, Formal Aspects of Computing.

[21]  Susan Owicki,et al.  An axiomatic proof technique for parallel programs I , 1976, Acta Informatica.

[22]  Geguang Pu,et al.  Semantics of BPEL4WS-Like Fault and Compensation Handling , 2005, FM.

[23]  Ketil Stølen,et al.  A Method for the Development of Totally Correct Shared-State Parallel Programs , 1991, CONCUR.

[24]  Jifeng He,et al.  A model for BPEL-like languages , 2007, Frontiers of Computer Science in China.

[25]  Ian J. Hayes,et al.  FM 2005: Formal Methods, International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005, Proceedings , 2005, FM.

[26]  Michael J. Butler,et al.  A Process Compensation Language , 2000, IFM.

[27]  Jozef Hooman,et al.  Concurrency Verification: Introduction to Compositional and Noncompositional Methods , 2001, Cambridge Tracts in Theoretical Computer Science.