2004/06/28 by Andrea Ferrara, Ferrara, Andrea
Computer Science · #Advanced Software Engineering Methodologies #Formal Methods in Verification #Service-Oriented Architecture and Web Services #cs.AI #cs.DB
paper · pdf · doi:10.48550/arxiv.cs/0406055
arxiv created 2004/06/28 · arxiv updated 2009/12/01
It is now well-admitted that formal methods are helpful for many issues raised in the Web service area. In this paper we present a framework for the design and verification of WSs using process algebras and their tools. We define a two-way mapping between abstract specifications written using these calculi and executable Web services written in BPEL4WS. Several choices are available: design and correct errors in BPEL4WS, using process algebra verification tools, or design and correct in process algebra and automatically obtaining the corresponding BPEL4WS code. The approaches can be combined. Process algebra are not useful only for temporal logic verification: we remark the use of simulation/bisimulation both for verification and for the hierarchical refinement design method. It is worth noting that our approach allows the use of any process algebra depending on the needs of the user at different levels (expressiveness, existence of reasoning tools, user expertise).