对基于组件的协议规范进行模型检查,以证明设计的正确性

P. Kaliappan, H. Koenig
{"title":"对基于组件的协议规范进行模型检查,以证明设计的正确性","authors":"P. Kaliappan, H. Koenig","doi":"10.1109/ICCIC.2014.7238351","DOIUrl":null,"url":null,"abstract":"We developed a component-oriented modeling approach for the design of communication protocols and distributed systems. The approach aims at the reuse of components represented by means of Unified Modeling Language (Uml) diagrams. Designs based on compositions of components have to formally be proved for correctness. In this paper we propose a verification approach by combining trace equivalence and model checking to verify UML-based designs of communication protocols. Our method consists of two steps. Foremost, the internal and external component behaviors are verified independently regarding their formal correctness. Thereafter the correctness and consistency of compositions is verified. This is achieved by generating the component adaptation path as traces during the composition. The requirements, i.e., safety and liveness properties, are formulated using linear temporal logic formulae. We apply the Spin tool as our model checking mechanism. For this, we present a method for automatically transforming the designs into Promela. We evaluate our approach for an example data transfer protocol as a case study.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Model checking the component-based protocol specification for proving the design correctness\",\"authors\":\"P. Kaliappan, H. Koenig\",\"doi\":\"10.1109/ICCIC.2014.7238351\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We developed a component-oriented modeling approach for the design of communication protocols and distributed systems. The approach aims at the reuse of components represented by means of Unified Modeling Language (Uml) diagrams. Designs based on compositions of components have to formally be proved for correctness. In this paper we propose a verification approach by combining trace equivalence and model checking to verify UML-based designs of communication protocols. Our method consists of two steps. Foremost, the internal and external component behaviors are verified independently regarding their formal correctness. Thereafter the correctness and consistency of compositions is verified. This is achieved by generating the component adaptation path as traces during the composition. The requirements, i.e., safety and liveness properties, are formulated using linear temporal logic formulae. We apply the Spin tool as our model checking mechanism. For this, we present a method for automatically transforming the designs into Promela. We evaluate our approach for an example data transfer protocol as a case study.\",\"PeriodicalId\":187874,\"journal\":{\"name\":\"2014 IEEE International Conference on Computational Intelligence and Computing Research\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Computational Intelligence and Computing Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIC.2014.7238351\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Computational Intelligence and Computing Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIC.2014.7238351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们开发了一种面向组件的建模方法来设计通信协议和分布式系统。该方法旨在重用由统一建模语言(Uml)图表示的组件。基于组件组合的设计必须正式证明其正确性。在本文中,我们提出了一种结合跟踪等价和模型检查的验证方法来验证基于uml的通信协议设计。我们的方法包括两个步骤。最重要的是,内部和外部组件行为根据其形式正确性进行独立验证。从而验证了组合的正确性和一致性。这是通过在组合过程中生成组件自适应路径作为轨迹来实现的。需求,即安全性和活动性,是用线性时间逻辑公式表述的。我们使用Spin工具作为我们的模型检查机制。为此,我们提出了一种将设计自动转换为Promela的方法。我们以一个示例数据传输协议作为案例研究来评估我们的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Model checking the component-based protocol specification for proving the design correctness
We developed a component-oriented modeling approach for the design of communication protocols and distributed systems. The approach aims at the reuse of components represented by means of Unified Modeling Language (Uml) diagrams. Designs based on compositions of components have to formally be proved for correctness. In this paper we propose a verification approach by combining trace equivalence and model checking to verify UML-based designs of communication protocols. Our method consists of two steps. Foremost, the internal and external component behaviors are verified independently regarding their formal correctness. Thereafter the correctness and consistency of compositions is verified. This is achieved by generating the component adaptation path as traces during the composition. The requirements, i.e., safety and liveness properties, are formulated using linear temporal logic formulae. We apply the Spin tool as our model checking mechanism. For this, we present a method for automatically transforming the designs into Promela. We evaluate our approach for an example data transfer protocol as a case study.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信