Component-based verification using incremental design and invariants

被引:15
作者
Bensalem, Saddek [1 ]
Bozga, Marius [1 ]
Legay, Axel [2 ]
Thanh-Hung Nguyen [3 ]
Sifakis, Joseph [1 ]
Yan, Rongjie [4 ]
机构
[1] UJF Grenoble 1, CNRS, VERIMAG UMR 5104, F-38041 Grenoble, France
[2] INRIA, IRISA, F-35042 Rennes, France
[3] Hanoi Univ Sci & Technol, Dept Software Engn, Hanoi, Vietnam
[4] State Key Lab Comp Sci, Beijing 100190, Peoples R China
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
Verification method; Invariant; Component-based systems; Incremental design; Verification tools; Deadlock-freedom; BIP;
D O I
10.1007/s10270-014-0410-8
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We propose invariant-based techniques for the efficient verification of safety and deadlock-freedom properties of component-based systems. Components and their interactions are described in the BIP language. Global invariants of composite components are obtained by combining local invariants of their constituent components with interaction invariants that take interactions into account. We study new techniques for computing interaction invariants. Some of these techniques are incremental, i.e., interaction invariants of a composite hierarchically structured component are computed by reusing invariants of its constituents. We formalize incremental construction of components in the BIP language as the process of building progressively complex components by adding interactions (synchronization constraints) to atomic components. We provide sufficient conditions ensuring preservation of invariants when new interactions are added. When these conditions are not satisfied, we propose methods for generating new invariants in an incremental manner by reusing existing invariants from the constituents in the incremental construction. The reuse of existing invariants reduces considerably the overall verification effort. The techniques have been implemented in the D-Finder toolset. Among the experiments conducted, we have been capable of verifying safety properties and deadlock-freedom of sub-systems of the functional level of the DALA autonomous robot. This work goes far beyond the capacity of existing monolithic verification tools.
引用
收藏
页码:427 / 451
页数:25
相关论文
共 68 条
[1]  
Abdellatif T., 2010, Proceedings of the tenth ACM international conference on Embedded software, P229
[2]   Reactive modules [J].
Alur, R ;
Henzinger, TA .
FORMAL METHODS IN SYSTEM DESIGN, 1999, 15 (01) :7-48
[3]  
[Anonymous], 1995, Temporal verification of reactive systems: safety
[4]  
[Anonymous], 57 MIT PROJ MAC COMP
[5]  
[Anonymous], THESIS I NATL POLYTE
[6]  
[Anonymous], CONCURRENCY VERIFICA
[7]  
[Anonymous], 2001, LNCS, DOI [DOI 10.1007/3-540-45449-7_11, DOI 10.1007/3-540-45449-711]
[8]  
[Anonymous], THE OMEGA
[9]  
[Anonymous], 2000, Int. J. Softw. Tools for Technol. Transf. (STTT), DOI [10.1007/s100090050046, DOI 10.1007/S100090050046]
[10]  
[Anonymous], 1989, CWI-Quarterly