Assertional Reasoning for Concurrent and Communicating BPEL-like Programs

Longfei Zhu, Qiwen Xu, Huibiao Zhu
2018 Communication Papers of the 2018 Federated Conference on Computer Science and Information Systems  
This paper studies verification of programs similar to BPEL4WS (BPEL), the latter being a de facto standard for the web services composition and orchestration. Traditionally, in verification of concurrent and distributed programs, the model was either based on shared variables or message passing and was studied separately. BPEL-like programs have features that are present in both models: several flows within one service can be executed in parallel and they can access shared variables, whereas
more » ... veral services communicate by message passing. Therefore, it is natural that for verification of BPEL-like programs, the verification methods developed for shared variables and message passing be integrated. In this paper, we combine the proof rules for shared variable programs from Owicki and Gries, the proof rules for CSP like programs from Apt, Francez and de Roever, together with proof rules for compensation and fault handling, to cover all major features of BPEL. An operational semantics is presented and the proof rules can be justified over that. Examples are provided to show the feasibility of verification framework.
doi:10.15439/2018f148 dblp:conf/fedcsis/ZhuXZ18 fatcat:3tjsc3kvzvcv3e3lavkssmkbsm