Verifying BPEL-Like Programs with Hoare Logic

The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechanism. To understand it better, many recent works have mainly focused on formal semantic models for WS-BPEL. In this paper, we make one step forward by investigating the verification problem for business processes written in BPEL-like languages. We propose a set of proof rules in Hoare-logic style as an axiomatic verification system for a BPEL-like core language containing key features such as data states, fault and compensation handling. We also propose a big-step operational semantics which incorporates all these key features. Our verification rules are proven sound with respect to this underlying semantics. The application of the verification rules is illustrated via the proof search process for a nontrivial example.

• Type: Conference
• Year: 2008
• Where: TASE
• Authors: Chenguang Luo, Shengchao Qin, Zongyan Qiu
• Keywords: Business Processes, Programmable Compensation Mechanism, Software Engineering, TASE 2008, WS-BPEL Language