Abstract Reachability Graph for Verifying Web Service Interfaces

  • Authors:

  • Xutao Du;Chunxiao Xing;Lizhu Zhou

  • Affiliations:

  • Research Institute of Information Technology, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing, Chin ...;Research Institute of Information Technology, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing, Chin ...;Research Institute of Information Technology, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing, Chin ...

  • Venue:
  • ICSR '08 Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Web Service Interface Control Flow Automata(WCFA) is presented to model web service interfaces. An Abstract Reachability Graph(ARG) is constructed for the composite web service based on available WCFAs. Nodes in ARG are equipped with a state formula which is an overestimation of the concrete reachable state properties. The algorithm we present to compute the ARG is a variation of the depth first search algorithm. State formulas are computed at the same time with the construction of ARG. Assertions can be made at control points(nodes)to express certain properties. A SAT solver is used to check whether assertions are logical consequences of the state formulas. Then the answer(valid or invalid) will give designers enough information to decide whether the composite web service works as intended.