Affiliation:
1. SAMOVAR, Telecom SudParis, Institut Polytechnique de Paris, Evry, 91025 France
2. University of Monastir, B.P 56 Avenue Taher Hadded, Monastir 5000, Tunisia
Abstract
Abstract
Many disciplines have adopted component-based principles to avail themselves of the many advantages they bring, especially component reusability. In a short time, the component-based architecture became a renown branch in the IT world and the center of interest of many researchers. Much work has been conducted in this context for the verification of component-based applications (CBAs). However, the main focus has been on the structural aspect of such compositions, while the behavioral aspect has seldom been dealt with. In this paper, our goal is to close this gap and propose a formal approach to verify the behavioral correctness of CBAs. We first define a set of requirements to be satisfied by the structure and the behavior of a CBA, represented by a set of interactions that may occur between their components. Then, we build a formal Event-B model to represent these requirements in a rigorous and non-ambiguous way. The use of the Event-B refinement technique allows us to master the complexity of CBAs by introducing their elements in an incremental manner. The correctness of the development is ensured by establishing a set of proof obligations, under the Rodin platform, and also by animating it with the ProB animator/model checker. The approach is illustrated by a running example.
Publisher
Oxford University Press (OUP)
Reference47 articles.
1. The B-Book
2. Modeling in Event-B
3. A theory of timed automata;Alur;Theoret. Comput. Sci.,1994
4. An Abstract Framework for Deadlock Prevention in BIP;Attie,2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Specification and Verification of Communication Paradigms for CBSE in Event B;2023 27th International Conference on Engineering of Complex Computer Systems (ICECCS);2023-06-14