DocumentCode :
2346826
Title :
Incremental Invariant Generation for Compositional Design
Author :
Bensalem, Saddek ; Legay, Axel ; Nguyen, Thanh-Hung ; Sifakis, Joseph ; Yan, Rongjie
fYear :
2010
fDate :
25-27 Aug. 2010
Firstpage :
157
Lastpage :
167
Abstract :
We consider a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interactions. The method is based on the use of two kinds of invariants. Component invariants are over-approximations of components´ reach ability sets. Interaction invariants are constraints on the states of components involved in interactions. In this paper we propose fixed point characterization for computing interaction invariants. We also propose a new technique that takes the incremental design of the system into account. In many situations, the technique will help to avoid redoing all the verification process each time an interaction is added in the design. Our two techniques have been implemented as extension of the D-Finder toolset. The result has been applied to check deadlock-freedom on several case studies. Our experiments show that our new methodology is generally much faster than existing ones.
Keywords :
checkpointing; object-oriented programming; program verification; programming languages; BIP language; D-Finder toolset; component invariants; component-based systems; compositional design; deadlock-freedom; fixed point characterization; incremental invariant generation; interaction invariants; multiparty interactions; over-approximations; verification process; Bismuth; Connectors; Equations; Explosions; Manuals; Synchronization; System recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Theoretical Aspects of Software Engineering (TASE), 2010 4th IEEE International Symposium on
Conference_Location :
Taipei
Print_ISBN :
978-1-4244-7847-7
Type :
conf
DOI :
10.1109/TASE.2010.23
Filename :
5587717
Link To Document :
بازگشت