We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Path-Sensitive Reachability Analysis of Web Service Interfaces (Short Paper)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xutao Du ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing ; Chunxiao Xing ; Lizhu Zhou

WCFA (Web service interface control flow automata) is enhanced by allowing pre/post-conditions for certain Web service invocations to be declared. The formal definition of WCFA is given. Global behaviors of web service compositions (described by a set of WCFA) are captured by ARG (abstract reachability graph), in which each control point is equipped with a state formula and a call stack. The algorithm for constructing ARG uses a path-sensitive analysis to compute the state formulas. Pre/post-conditions are verified during the construction, where unreachable states are detected and pruned. Assertions can be made at nodes of ARG to express both safety properties and call stack inspection properties. Then a SAT solver is used to check whether the assertions are logical consequences of the state formulas(or/and call stacks).

Published in:

Quality Software, 2008. QSIC '08. The Eighth International Conference on

Date of Conference:

12-13 Aug. 2008