- Flat Parametric Counter Automata Marius Bozga 1 , Radu Iosif 1 , and Yassine Lakhnech 1
- Pattern-based Abstraction for Verifying Secrecy in Protocols ?
- Divide, Abstract, and Model-Check ? Karsten Stahl ?? , Kai Baukus, Yassine Lakhnech, and Martin Ste en
- Computing Abstractions of Infinite State Systems Compositionally and Automatically \Lambda
- e Mixte de Recherche 5104 CNRS INPG UJF Centre Equation
- e Mixte de Recherche 5104 CNRS INPG UJF Centre Equation
- HERMES: Automatic Veri cation of Secrecy in Security Protocols ?
- A symbolic decision procedure for cryptographic protocols with time stamps
- A Transformational Approach for Generating Non-Linear Invariants ?
- Computational Indistinguishability Logic Gilles Barthe
- Abstracting WS1S Systems to Verify Parameterized Networks ?
- Unite Mixte de Recherche 5104 CNRS -INPG -UJF Centre Equation
- On the equality of probabilistic terms Gilles Barthe1
- Iterating transducers ? Dennis Dams 1 , Yassine Lakhnech 2 , and Martin Ste en 3
- e Mixte de Recherche 5104 CNRS INPG UJF Centre Equation
- Unite Mixte de Recherche 5104 CNRS -INPG -UJF Centre Equation
- Pattern-based Abstraction for Verifying Secrecy in Protocols
- Analyzing Fair Parametric Extended Automata A. Bouajjani 2 , A. CollombAnnichini 1 , Y. Lakhnech 1 , and M. Sighireanu 2
- Incremental Veri cation by Abstraction ? Y. Lakhnech 1?? ,
- Verifying Universal Properties of Parameterized Networks Kai Baukus 1 Yassine Lakhnech 2y Karsten Stahl 1
