CDLVT: A Formal Verification Tool of Non-functional Properties for WS-CDL Specification

S. Rebai, Hatem Hadj Kacem, M. Karaa, S. Hernández, A. Kacem
{"title":"CDLVT: A Formal Verification Tool of Non-functional Properties for WS-CDL Specification","authors":"S. Rebai, Hatem Hadj Kacem, M. Karaa, S. Hernández, A. Kacem","doi":"10.1109/WETICE.2015.14","DOIUrl":null,"url":null,"abstract":"Service-oriented architectures (SOA) are hugely adopted. Within the SOA, service composition is fundamental. The design of composing service-based applications is mainly carried out throughout two composition techniques namely choreography and orchestration. Although these two composition models are different in nature, they are complementary. Choreography presents an abstract description of protocols. It offers a top view of the management rules which govern the interactions between the services involved in a decentralized application. On the other hand, orchestration provides details of the executable process at single peers which are necessary for the implementation of choreography. In this context, one open research problem, is the correct transformation of choreography specifications to orchestration specifications since orchestration provides more details to choreography specification. The choreography transformation has been the subject of several research works. Nevertheless, the existing works have considered that the choreography, on which their transformations are based, is correct by default. So, it is crucial to implement a checking process oriented to identify eventual incompatibilities that may arise. For this purpose, we present a formal verification approach based on the SPIN model-checker. The approach automatically transforms WS-CDL choreography specifications to Promela code for verification purposes. We verify non-functional properties that are expressed with linear temporal logic.","PeriodicalId":256616,"journal":{"name":"2015 IEEE 24th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 24th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WETICE.2015.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Service-oriented architectures (SOA) are hugely adopted. Within the SOA, service composition is fundamental. The design of composing service-based applications is mainly carried out throughout two composition techniques namely choreography and orchestration. Although these two composition models are different in nature, they are complementary. Choreography presents an abstract description of protocols. It offers a top view of the management rules which govern the interactions between the services involved in a decentralized application. On the other hand, orchestration provides details of the executable process at single peers which are necessary for the implementation of choreography. In this context, one open research problem, is the correct transformation of choreography specifications to orchestration specifications since orchestration provides more details to choreography specification. The choreography transformation has been the subject of several research works. Nevertheless, the existing works have considered that the choreography, on which their transformations are based, is correct by default. So, it is crucial to implement a checking process oriented to identify eventual incompatibilities that may arise. For this purpose, we present a formal verification approach based on the SPIN model-checker. The approach automatically transforms WS-CDL choreography specifications to Promela code for verification purposes. We verify non-functional properties that are expressed with linear temporal logic.
CDLVT: WS-CDL规范的非功能属性的形式化验证工具
面向服务的体系结构(SOA)被广泛采用。在SOA中,服务组合是基础。组合基于服务的应用程序的设计主要通过两种组合技术来实现,即编排和编排。这两种构图模式虽然性质不同,但互为补充。编排是对协议的抽象描述。它提供了管理规则的俯视图,这些规则管理分散应用程序中涉及的服务之间的交互。另一方面,编排提供了单个节点上可执行流程的详细信息,这是实现编排所必需的。在此上下文中,一个开放的研究问题是将编排规范正确地转换为编排规范,因为编排为编排规范提供了更多的细节。编舞的转型一直是一些研究工作的主题。然而,现有的作品已经考虑到它们的转换所基于的编排在默认情况下是正确的。因此,实现一个面向识别可能出现的最终不兼容性的检查过程是至关重要的。为此,我们提出了一种基于SPIN模型检查器的形式化验证方法。该方法自动将WS-CDL编排规范转换为Promela代码以进行验证。我们验证用线性时间逻辑表示的非功能属性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信