DocumentCode
2608966
Title
Path-Sensitive Reachability Analysis of Web Service Interfaces (Short Paper)
Author
Du, Xutao ; Xing, Chunxiao ; Zhou, Lizhu
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing
fYear
2008
fDate
12-13 Aug. 2008
Firstpage
114
Lastpage
119
Abstract
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).
Keywords
Web services; graph theory; reachability analysis; sensitivity analysis; user interfaces; Web service interface control flow automata; abstract reachability graph; call stack inspection properties; path-sensitive analysis; path-sensitive reachability analysis; safety properties; Algorithm design and analysis; Automata; Automatic control; Inspection; Reachability analysis; Safety; Software quality; Testing; Web services; Yarn; reachability analysis; verification; web service composition; web service interface;
fLanguage
English
Publisher
ieee
Conference_Titel
Quality Software, 2008. QSIC '08. The Eighth International Conference on
Conference_Location
Oxford
ISSN
1550-6002
Print_ISBN
978-0-7695-3312-4
Type
conf
DOI
10.1109/QSIC.2008.8
Filename
4601534
Link To Document