It considers at this stage to define the structure of reliability and safe future identification
system and develop or adopt appropriate algorithms and security protocols to cover …

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 …

Compilation of a Petri net model is one way to accelerate its veri cation through state space
exploration. In this approach, code to explore the Petri net is generated, which avoids the …

Concevoir et implanter des programmes parallèles est une tâche complexe, sujette aux
erreurs. La vérification des programmes parallèles est également plus difficile que celle des …

This paper presents the implementation and the performance comparisons of two Bulk-
Synchronous Parallel (BSP) algorithms to compute the discrete state space of models …

It has long been a challenge to determine conclusively whether a given protocol is secure or
not. The development of formal techniques that can check various security properties is an …

De nos jours, l'informatique des programmes séquentiels laisse de plus en plus sa place au
parallèlisme, qu'il s' agisse d'un simple téléphone (les smartphones modernes ont bien …

This thesis takes part in the formal verification of parallel programs. The aim of formal
verification is to ensure that a program will run as it should, without making mistakes …

Explicit model-checking (MC) is a classical solution to find flaws in a security protocol. But it
is well-known that for non trivial protocols, MC may enumerate state-spaces of astronomical …

Cette thèse s' intéresse à la vérification de systèmes automatisables par model-checking. La
question sous-jacente autour de laquelle se construit la contribution est la recherche d'un …