{"title":"Reachability analysis of Web service interfaces","authors":"Xutao Du, Chunxiao Xing, Lizhu Zhou","doi":"10.1109/IRI.2008.4583002","DOIUrl":null,"url":null,"abstract":"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).","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Information Reuse and Integration","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRI.2008.4583002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
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).