Incremental Generation of Linear Invariants for Component-Based Systems

Saddek Bensalem 1 Marius Bozga 1 Benoît Boyer 2 Axel Legay 3
2 TRISKELL - Reliable and efficient component based software engineering
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
3 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Invariants generation has been intensively considered as an effective verification method for concurrent systems. However, none of the existing work on the topic strongly exploits the structure of the system and the algebra that defines the interactions between its components. This not only has an impact on the computation time, but also on the scalability of the method. In a series of recent work, we developed an efficient approach for generating invariants for systems described in the BIP component framework. BIP is an expressive modeling formalism including a rich algebra to describe component interactions. Our technique, which focuses on generating Boolean invariants corresponding to a subclass of the conjunctive normal form, was then extended to an incremental one capable of generating global invariants from smaller invariants obtained for sub-systems by exploiting the algebra that describes their interactions. This approach gives a panoply of techniques and libraries to rigurously design potentially complex systems. We also showed that Boolean invariants generated by our methodology correspond to trap of the Petri net induced by the BIP model. Unfortunately, this class of invariants may be too unprecise, and hence leads to discovery of false positive counter examples. The objective of this paper is to propose new techniques dedicated to the computation of linear interactions invariants, i.e., invariants that are described by linear constraints and that relate states of several components in the system. By definition, such new class is incomparable to the one of Boolean invariants, but we will show that it is generally more precise. In addition, we propose an incremental approach that allows to discover and reuse invariants that have already been computed on subparts of the model. Those new techniques have been implemented in DFINDER, a tool for checking deadlock freedom on BIP systems using invariants, and evaluated on several case studies. The experiments show that our approach outperforms classical techniques on a wide range of models.
Type de document :
Communication dans un congrès
3th International Conference on Application of Concurrency to System Design (ACSD), Jul 2013, Barcelona, Spain. pp.1-10, 2013
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00878738
Contributeur : Marius Bozga <>
Soumis le : mercredi 30 octobre 2013 - 16:54:50
Dernière modification le : vendredi 13 janvier 2017 - 14:16:48
Document(s) archivé(s) le : vendredi 31 janvier 2014 - 09:35:31

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00878738, version 1

Collections

Citation

Saddek Bensalem, Marius Bozga, Benoît Boyer, Axel Legay. Incremental Generation of Linear Invariants for Component-Based Systems. 3th International Conference on Application of Concurrency to System Design (ACSD), Jul 2013, Barcelona, Spain. pp.1-10, 2013. <hal-00878738>

Partager

Métriques

Consultations de
la notice

412

Téléchargements du document

197