Mohamed Tahar Bhiri

Towards a Practical Approach to Check Service Component Architecture

The components based approach aims at the re-use by an easy components assembly. A coherent components assembly requires the verification of properties related to the consistency of interface, semantics, synchronization, and the non-functional. We aim at the checking of the structural and non-functional properties of a SCA (Service Component Architecture assembly) endowed with the non-functional properties described in a CQML type language. Our approach, which is based on an assembly by contracts established between components assembly. We propose to use the Acme/Armani ADL as contract definition language.

An Event-B Development Process for the Distributed BIP Framework

We present a refinement-based methodology to design correct by construction distributed systems specified as Event-B models. Starting from an Event-B machine, the studied process proposes successive steps in order to split and schedule the computation of complex events and then to map them on subcomponents. The specification of these steps is done through two domain specific languages. From these specifications, two refinements are generated. Eventually, a distributed code architecture is also generated. The correctness of the process relies on the correctness of the refinements and the translation. We target the distributed BIP framework.

Behavioral Verification of Service Component Architecture

Currently,much research looks at treating the behavior properties beginning with the architectural design phase in SCA (Software Component Architectures) based applications. In this paper,we propose to map SCA onto the Wright ADL in order to verifythe behavioral consistency of SCA software architectures. To achieve this goal, we suggesttranslating this source software architecture into a Wright configuration. Using Wr2fdrtool, this Wright configuration can be automatically translated to a CSP specificationacceptable by the FDR2 model-checker.

Automatic Refinement for Event-B through Annotated Patterns

In this paper, we investigate how patterns could be used in order to generate Event-B refinements automatically through DSL(s) for temporal, timed or distribution patterns. Our ulimate goal is to generate code for a concurrent, or distributed framework, e.g., BIP.

UML2ADA for Early Verification of Concurrency Inside the UML2.0 Atomic Components

In recent years, the Unified Modeling Language (UML) has emerged as a de facto industrial standard for modeling Component-Based Software (CBS). However, in order to ensure the safety and vivacity of UML CBS, many approaches have been proposed to verify the concurrency between interconnected components. But, rare are the works that tackle concurrency verification inside atomic components. In this paper, our purpose was the verification of the concurrency inside UML2.0 atomic components endowed with behavioral specifications described by protocol state machines (PSM). To achieve this, we propose to translate the UML2.0/PSM source component to an Ada concurrent program. Using an Ada formal analysis tool such as FLAVERS or INCA tools, we could detect the potential behavioral concurrency properties such as the deadlock of an Ada concurrent program.

Verification and validation of PDDL descriptions using Event-B formal method

The automatic planning community of Artificial Intelligence AI have developed a de facto standard language for PDDL, producing formal modeling of Planning problems. Equally it have conceived and produced tools called planners to automatically generate plans for PDDL descriptions. But the verification and validation of PDDL descriptions is little treated topic. In this paper, we shall treat this issue through the Event-B formal method. We illustrate the contribution of the static analysis tools associated with Event-B (provers, model checker, animator, and simulator) for verification and validation of PDDL descriptions.

Coupling Event-B/ProB for the Analysis of the Software Architecture Evolution Described in PDDL

The PDDL language is used to formally describe planning problems. It has tools called planners to solve planning problems described in PDDL. Equally, it has plan validation tools to validate the solution plans. Our automatic approach to transform a planning problem written in PDDL to Event-B method allows the use of the correct-by-construction paradigm associated to Event-B formal method. We propose a modeling PDDL for Software Architecture Evolution. Then, we translate our PDDL description in Event-B using our plugin PDDL2EventB. Finally, we reason on the Event-B model generated by the use of ProB including: animation, model checking and deadlock-free.

From an abstract specification in event-b toward an UML/OCL model

The formal approach of software development promotes getting proved correct software. It faces the shortcomings of the classical approach concerning the ambiguity of the requirements document, the risk of errors distributed to all phases and the high testing cost (because of late detection of such errors). However, this approach poses problems mainly related to the participation of various actors not necessarily professionals in formal methods, maintenance and especially the development of an optimal refinement strategy. To overcome the limitations of these two approaches, we propose a hybrid approach that combines the formal approach (Event-B) and the classical approach (UML/OCL). Upstream phases of our approach include: Rewriting the requirements document, Refinement strategy, Abstract specification, Horizontal refinement and Validation. Downstream phases contain the Construction of a UML/EM-OCL model, Refinement, Integration of design and implementation decisions, Coding and Integration. In this paper, we show the feasibility of our approach on a case study: An Electronic Hotel Key System (SCEH). The problem of transition from formal (Event-B) to the semi-formal (UML/OCL) is processed by our OCL extension called EM-OCL.