Incremental component-based construction and verification using invariants

S. Bensalem, M. Bozga, Axel Legay, Thanh-Hung Nguyen, J. Sifakis, Rongjie Yan
{"title":"Incremental component-based construction and verification using invariants","authors":"S. Bensalem, M. Bozga, Axel Legay, Thanh-Hung Nguyen, J. Sifakis, Rongjie Yan","doi":"10.5555/1998496.1998542","DOIUrl":null,"url":null,"abstract":"We propose invariant-based techniques for the efficient verification of safety and deadlock properties of concurrent systems. We assume that components and component interactions are described within the BIP framework, a tool for component-based design. We build on a compositional methodology in which the invariant is obtained by combining the invariants of the individual components with an interaction invariant that takes concurrency and interaction between components into account. In this paper, we propose new efficient techniques for computing interaction invariants. This is achieved in several steps. First, we propose a formalization of incremental component-based design. Then we suggest sufficient conditions that ensure the preservation of invariants through the introduction of new interactions. For cases in which these conditions are not satisfied, we propose methods for generation of new invariants in an incremental manner. The reuse of existing invariants reduces considerably the verification effort. Our techniques have been implemented in the D-Finder toolset. Among the experiments conducted, we have been capable of verifying properties and deadlock-freedom of DALA, an autonomous robot whose behaviors in the functional level are described with 500000 lines of C Code. This experiment, which is conducted with industrial partners, is far beyond the scope of existing academic tools such as NuSMV or SPIN.","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"20 1","pages":"257-256"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"63","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Formal Methods in Computer-Aided Design (FMCAD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/1998496.1998542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 63

Abstract

We propose invariant-based techniques for the efficient verification of safety and deadlock properties of concurrent systems. We assume that components and component interactions are described within the BIP framework, a tool for component-based design. We build on a compositional methodology in which the invariant is obtained by combining the invariants of the individual components with an interaction invariant that takes concurrency and interaction between components into account. In this paper, we propose new efficient techniques for computing interaction invariants. This is achieved in several steps. First, we propose a formalization of incremental component-based design. Then we suggest sufficient conditions that ensure the preservation of invariants through the introduction of new interactions. For cases in which these conditions are not satisfied, we propose methods for generation of new invariants in an incremental manner. The reuse of existing invariants reduces considerably the verification effort. Our techniques have been implemented in the D-Finder toolset. Among the experiments conducted, we have been capable of verifying properties and deadlock-freedom of DALA, an autonomous robot whose behaviors in the functional level are described with 500000 lines of C Code. This experiment, which is conducted with industrial partners, is far beyond the scope of existing academic tools such as NuSMV or SPIN.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
增量的基于组件的构造和使用不变量的验证
我们提出了基于不变量的技术来有效地验证并发系统的安全性和死锁特性。我们假设组件和组件交互是在BIP框架(一种基于组件的设计工具)中描述的。我们建立在一种组合方法的基础上,其中不变量是通过将单个组件的不变量与考虑组件之间并发性和交互的交互不变量相结合而获得的。在本文中,我们提出了新的计算交互不变量的有效技术。这可以通过几个步骤实现。首先,我们提出了增量式基于组件的设计的形式化。然后,我们提出了通过引入新的相互作用来保证不变量保留的充分条件。对于不满足这些条件的情况,我们提出了以增量方式生成新不变量的方法。现有不变量的重用大大减少了验证工作。我们的技术已经在D-Finder工具集中实现了。在进行的实验中,我们已经能够验证DALA的属性和死锁自由性,DALA是一个自主机器人,其功能层面的行为用50万行C代码描述。这项实验是与工业伙伴一起进行的,远远超出了NuSMV或SPIN等现有学术工具的范围。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The FMCAD 2022 Student Forum How Testable is Business Software? The FMCAD 2020 Student Forum From Correctness to High Quality Concurrent Chaining Hash Maps for Software Model Checking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1