Fabrice Legond-Aubry

Learn More
In this paper, we present the JAC (Java Aspect Components) framework to build aspectoriented distributed applications in Java. This paper goes from the aspect-oriented programming means to the architectural details of the framework implementation. The two core mechanisms depicted to extend the application semantics in order to add well-separated concerns(More)
This position paper presents a UML notation for designing aspect-oriented applications. It is extracted from our experiences when building the JAC framework and from the concepts dened in the AspectJ language or in Aspectual Components. This notation is a proposal for a rst step towards a high-level designing graphical language that can be used when(More)
We propose a new composition approach to mutual exclusion algorithms for applications spread over a grid which is composed of a federation of clusters. Taking into account the heterogeneity of communication latency, our hierarchical architecture combines intra and inter cluster algorithms. We focus on token-based algorithms and study different compositions(More)
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 [34] and 2012 [33]. The participating tools were compared on(More)
We encountered some limits when using the GreatSPN model checker on life-size models, both in time and space complexity. Even when the exponential blow-up of state space size is adequately handled by the tool thanks to the use of a canonization function that allows to exploit system symmetries, time complexity becomes critical. Indeed the canonization(More)
We 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éhel’s algorithm and a hierarchical approach, suitable to cope with the intrinsic heterogeneity of communication latencies of Grid environments, are(More)
Components are increasingly used to create complex and distributed systems and applications. They are often viewed as simple servers, which limits their capacity for collective action. In this paper, we propose a method to simplify their assembly and their potential re-usability. We use the notion of dependency and contract between components to explicitly(More)
In 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(More)