#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Frédéric Gava, Jean Fortin, Michaël Guedj
- IFM
- 2013

As any software, model-checkers are subject to bugs. They can thus report false negatives or validate a model that they should not. Different methods, such as theorem provers or Proof-Carrying Code, have been used to gain more confidence in the results of model-checkers. In this paper, we focus on using a verification condition generator that takes… (More)

- Frédéric Gava, Michaël Guedj, Franck Pommereau
- 2012 11th International Symposium on Parallel and…
- 2012

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)

- Frédéric Gava, Michaël Guedj, Franck Pommereau
- 2012 20th Euromicro International Conference on…
- 2012

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)

- Michaël Guedj
- 2016 IEEE 15th International Conference on…
- 2016

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)

- Frédéric Gava, Michaël Guedj, Franck Pommereau
- The Journal of Supercomputing
- 2012

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)

- ‹
- 1
- ›