Reachability analysis of Web service interfaces

We use WCFA (Web Service Interface Control Flow Automata) to model web service interfaces. Global behaviors of web service compositions are captured by abstract reachability graph(ARG). A polynomial time algorithm for the construction of ARG is presented. The algorithm uses a reachability analysis to verify both safety and call stack inspection properties. Both kinds of properties are expressed by assertions at control points of ARG. Each control point is equipped with a state formula and a call stack. Verification is done by a SAT solver which checks whether the assertions are logical consequences of the state formulas(or the call stacks).