loading...
Analysis of BPEL Data Dependencies
Lubeck, Germany August 28-August 31
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EUROMICRO.2007.1733rd EUROMICRO Conference on Software ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yongyan Zheng, University of Surrey, UK
Jiong Zhou, University of Surrey, UK
Paul Krause, University of Surrey, UK
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The current formal semantics proposed for BPEL can be categorized under three branches: Process Algebra, Petrinets, and Automata. Our goal is to automate the generation and execution of test cases for composed web services. Model checking is an effective technique for automated test generation, and most mature model checkers such as SPIN and NuSMV use automata as the underlying formal model. Hence, we follow the automata branch. Unfortunately, the current automata based approaches omit the BPEL data dependencies. In order to address this shortcoming, we demonstrate how to model BPEL data dependencies in our proposed web service automata.
Citation:
Yongyan Zheng, Jiong Zhou, Paul Krause, "Analysis of BPEL Data Dependencies," euromicro, pp.351-358, 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (EUROMICRO 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.