An Approach Towards the Verification of Component-Based Systems via Model Checking

Verification of software has received a lot of attentions of the software engineering community, specially modular verification of component-based software. However, to realize such an ideal component-based software paradigm, one of the key issues is to ensure that those separately specified and implemented components do not conflict to each other when composed the component consistency issue. A potential solution to the above issue is modular verification of component-based software via model checking. The main goal in this thesis is to combine the best advantages of model checking and component-based development. Currently there are many approaches have been proposed in modular verification of component-based software [2, 4, 7, 8, 10, 11, 22]. In [10, 11, 22], modular verification is rather closed. It is not prepared for future changes. If a component is added to the system, the whole system of many existing components and the new component must be re-checked altogether. For this reason, the “state space explosion problem” will occur when it checks complex software. The approach in [2, 4, 7, 8] focuses on checking a system composed of two components; M1 and M2 which satisfies the property p without composing M1 with M2. For this goal, this technique finds an assumption A such that it is strong enough for M1 to satisfy p and weak enough to be discharged by M2. From these, the composition