Michaël Guedj

  • Citations Per Year
Learn More
This paper presents a distributed (Bulk-Synchronous Parallel or bsp) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a ctl $$^*$$ ∗ formula. Using the structured nature of the security protocols allows us to design a simple method to distribute the state space under consideration in a need-driven fashion. Based on(More)
This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a LTL formula. Using the structured nature of the security protocols allows us to design a simple and efficient parallelisation of an algorithm which constructs the state-space under consideration in a need-driven(More)
This paper presents the implementation and the performance comparisons of two Bulk-Synchronous Parallel (BSP) algorithms to compute the discrete state space of models. These algorithms are simple to express and the first one is the most general one whereas the second is dedicated for structured models of security protocols. Benchmarks of security protocol(More)
Recently, job recommendation has attracted a lot of research attention, the aim being to get a sorted list of relevant candidates for an applicant (job sekeer or recruiter). To an effective matching, the utilisation of semantic technology has shown good results. Particularly, the use of taxonomy hierarchizing the skill following a relation of inheritance.(More)
The stable marriage problem is a well-known problem with many practical applications. Most algorithms to find stable marriages assume that the participants explicitly express a preference ordering. This can be problematic when the number of options is large or has a combinatorial structure. We show, by simply asking the actors (men and women) to fulfill a(More)
  • 1