A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Verifying BPEL-Like Programs with Hoare Logic
2008
2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
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
doi:10.1109/tase.2008.41
dblp:conf/tase/LuoQQ08
fatcat:3d66sipgs5cj3je5k3k4qc5l4u