An AOP Layer to Abstract Programming with Distributed Components

International audienceComponent models such as EJB or CCM are increasingly used to create complex and distributed systems and applications. Unless the details of the API and mechanisms used for programming with these models differ, the general features provided by the models share many characteristics. In this paper, we propose to capture these features in a common layer that can be used to develop model independant component programs. The layer is then mapped either onto EJB or CCM. This layer is defined with the AspectJ aspect-oriented programming language. We report on two samples applications that were developped with this layer: an application-level load balancing service and a contract enforcement service

Aspect-Oriented Software Development with Java Aspect Components

In the last four years, our research project dealt with separation of concerns for distributed programming environments and applications. This research effort led to the implementation of the Java Aspect Component (JAC) framework for aspect-oriented programming (AOP) in Java. Among the many requirements for distribution, flexibility and adaptability play a stringent role. The high variability of executing conditions (in terms of resources, servers availability, faults, ...) also brings the need for powerful programming paradigms. This led us to develop a dynamic model of AOP which, unlike statically compiled approaches, allows to on-the-fly deploy and undeploy aspects on top of running applications. This model comes with an UML notation and an implementation. An IDE is provided with JAC to support all the development steps of an aspect oriented application, from its design, to its implementation, to its deployment

Model Checking Contest @ Petri Nets, Report on the 2013 edition

This document presents the results of the Model Checking Contest held at Petri Nets 2013 in Milano. This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets. This is the third edition after two successful editions in 2011 and 2012. The participating tools were compared on several examinations (state space generation and evaluation of several types of formul{\ae} -- reachability, LTL, CTL for various classes of atomic propositions) run on a set of common models (Place/Transition and Symmetric Petri nets). After a short overview of the contest, this paper provides the raw results from the contest, model per model and examination per examination. An HTML version of this report is also provided (http://mcc.lip6.fr).Comment: one main report (422 pages) and two annexes (1386 and 1740 pages

Web Report on the Model Checking Contest @ Petri Net 2013

http://mcc.lip6.f

Contrats d'assemblage de composants

International audienc

Assembling Contracts for Components

International audienc

On the Formal Verification of a Generic Hierarchical Mutual Exclusion Algorithm

International audienceIn distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verification of a new generic hierarchical approach. This approach is based on the composition of classical already proof checked distributed algorithms. It overcomes some limitations of these classical algorithms by taking into account the network topology latencies and have a high scalability where centralized ones don’t. We also have formalized the properties of the mutual exclusion paradigm in order to verify them against our solution. We prove that our compositional approach preserves theses properties under the assumption that all used plain algorithms assert them. This verification by formal method checkers was eased by the efficient use of already proved mutual exclusion algorithms and the reduction of state spaces by exploiting the symmetries

Vérification formelle d'un algorithme générique et hiérarchique d'exclusion mutuelle

National audienceDans un environnement distribué, l'exclusion mutuelle des accès aux ressources partagées est un problème fondamental. En s'adaptant aux contraintes des nouvelles topologies de type GRID, les algorithmes d'exclusion mutuelle deviennent de plus en plus complexes et donc de plus en plus difficiles à prouver. Dans un cadre systématique et formel, nous proposons ici une nouvelle approche générique reposant sur la composition d'algorithmes existants et déjà prouvés ainsi que sur l'exploitation de la topologie physique du réseau. Notre composition permet un passage à l'échelle dans cet environnement hétérogène, tout en facilitant la preuve des algorithmes. Notre étude formalise les propriétés fondamentales de ce paradigme et montre par « model cheking » que notre algorithme de composition préserve bien les propriétés des algorithmes composés

Contrat d'assemblage de composants

National audienc

The impact of clustering on token-based mutual exclusion algorithms

International audienceWe present in this article a theoretical study and performance results about the impact of the Grid architecture on token-based mutual exclusion algorithms. To this end, both the original token-based Naimi-Tr'ehel's algorithm and a hierarchical approach, suitable to cope with the intrinsic heterogeneity of communication latencies of Grid environments, are studied and evaluated