首页> 外文会议>IEEE International Conference on Web Services >Statically Detect Data Races for WS-BPEL Web Services by Constraint Solver
【24h】

Statically Detect Data Races for WS-BPEL Web Services by Constraint Solver

机译:由约束求解器静态检测WS-BPEL Web服务的数据比赛

获取原文

摘要

Nowadays, Web services are widely used because of their interoperability and reusability. Multiple Web services can be composed following some business logic specified by BPEL (Business Process Execution Language) scripts. Since BPEL scripts allow specifying concurrent workflow, typical concurrency problems, such as data race, atomicity violation and order violation, also commonly occur in BPEL scripts. These issues are hard to detect and reproduce due to their non-determinism and the special language features of BPEL. In this paper, we implement a tool to detect data races for WS-BPEL based on static analysis approach and constraints solver. Our system is based on three key concepts: (1) a preprocess model to record necessary information, (2) a thorough Happens-Before model of WS-BPEL concurrency, (3) constraint encoding to transfer Happens-Before relationship to constraints and check if there is a feasible solution (namely data races) by Z3-Str solver. We evaluate the usability and performance of our tool on 10 benchmark programs with effective results.
机译:如今,由于其互操作性和可重用性,Web服务被广泛使用。可以在BPEL(业务流程执行语言)脚本指定的某些业务逻辑之后组成多个Web服务。由于BPEL脚本允许指定并发工作流,因此典型的并发问题,例如数据竞争,原子违规和违规,也通常在BPEL脚本中出现。由于其非确定性和BPEL的特殊语言特征,这些问题很难检测和重现。在本文中,我们实现了一种基于静态分析方法和约束求解器来检测WS-BPEL的数据比赛的工具。我们的系统基于三个关键概念:(1)要记录必要信息的预处理模型,(2)在WS-BPEL并发的模型之前发生彻底的发生,(3)编码到传输的约束发生在与约束和检查之前发生的组合。如果通过Z3-STR求解器存在可行的解决方案(即数据比赛)。我们在具有有效结果的10个基准程序上评估我们工具的可用性和性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号