Web服务接口的路径敏感可达性分析(短论文)

Xutao Du, Chunxiao Xing, Lizhu Zhou
{"title":"Web服务接口的路径敏感可达性分析(短论文)","authors":"Xutao Du, Chunxiao Xing, Lizhu Zhou","doi":"10.1109/QSIC.2008.8","DOIUrl":null,"url":null,"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).","PeriodicalId":6446,"journal":{"name":"2008 The Eighth International Conference on Quality Software","volume":"7 1","pages":"114-119"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Path-Sensitive Reachability Analysis of Web Service Interfaces (Short Paper)\",\"authors\":\"Xutao Du, Chunxiao Xing, Lizhu Zhou\",\"doi\":\"10.1109/QSIC.2008.8\",\"DOIUrl\":null,\"url\":null,\"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).\",\"PeriodicalId\":6446,\"journal\":{\"name\":\"2008 The Eighth International Conference on Quality Software\",\"volume\":\"7 1\",\"pages\":\"114-119\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 The Eighth International Conference on Quality Software\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QSIC.2008.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The Eighth International Conference on Quality Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QSIC.2008.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

通过允许声明某些Web服务调用的前置/后设条件,WCFA (Web服务接口控制流自动机)得到了增强。给出了WCFA的正式定义。web服务组合的全局行为(由一组WCFA描述)由ARG(抽象可达性图)捕获,其中每个控制点都配备了状态公式和调用堆栈。构造ARG的算法使用路径敏感分析来计算状态公式。在构建过程中验证前置/后置条件,其中检测和修剪不可达状态。可以在ARG的节点上进行断言,以表示安全属性和调用堆栈检查属性。然后使用SAT求解器检查断言是否是状态公式(或/和调用堆栈)的逻辑结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Path-Sensitive Reachability Analysis of Web Service Interfaces (Short Paper)
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).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信