Séminaire CEA LSL
Le séminaire du LSL a lieu en général le mardi au CEA
Saclay à 14h30, dans les locaux Nano-Innov, bâtiment 862 pièce 1073.
Responsables : Sébastien Bardin, Richard Bonichon, Julien Signoles et Zaynah Dargaye
Nous rejoindre : ici
Prochains orateurs
- 09.05.2017 :
Grégoire Scano
(IRT Saint-Exupéry)
- Vers la validation formelle de l'autonomie à bord des satellites
- 02.05.2017 :
Hugo Illous
(CEA LIST / LSL) -
A Relational Shape Abstract Domain
- 25.04.2017 :
Louis Mandel
(IBM Research) -
Q*cert: A Platform for Implementing and Verifying Query Compilers
- 18.04.2017 :
Thomas Sibut-Pinote
(Ecole Polytechnique)
- Bitcoin and other blockchains: an introduction and some research perspectives
Anciens exposés
- 06.04.2017 :
Lionel Blatter
(CEA LIST)
- RPP: Automatic Proof of Relational Properties by Self-Composition
- 04.04.2017 :
Michael Marcozzi
(CEA LIST)
- What's up with the Frama-C/LTest tool? Universality, scalability and mutant selection
- 10.03.2017 :
Laura Titolo
(National Institute of Aerospace, NASA)
- PRECiSA : Program Round-off Error in PVS
- 07.03.2017 :
Marie Pelleau
(UPMC)
- AbSolute, un solveur basé sur les domaines abstraits
- 02.03.2017 :
Catuscia Palamidessi
(Inria)
- Recent advances in Quantitative Information Flow
- 28.02.2017 :
Benoit Valiron
(CentraleSupelec - LRI) -
Programming and analyzing quantum algorithms
- 07.02.2017 :
Kostyantyn Vorobyov
(CEA LIST / LSL) - Shadow State Encoding for Efficient Monitoring of Block-level Properties
- 30.01.2017 :
Nicky Williams
(CEA LIST / LSL)
- From PathCrawler to TreeFrog: a new approach for branch coverage or multi-reachability
- 24.01.2017 :
Marco Gaboardi
(University at Buffalo)
- An Introduction to the Formal Verification of Differentially Private Algorithms
- 10.01.2017 :
Matthieu Lemerre
(CEA LIST)
- Combination of Symbolic and Semantic Program Analyses with Codex
- 09.01.2017 :
Arun Lakothia
(University of Louisiana)
- Harnessing Malware Intelligence for Defense and Attribution
- 13.12.2016 :
Catalin Hritcu
(Inria / Prosecco) -
Formally Secure Compilers to a Tagged Architecture
- 06.12.2016 :
Stephan Merz
(INRIA / Mosel) -
A Formal Analysis of the Pastry Algorithm in TLA+
- 29.11.2016 :
Karine Heydemann
(Université Paris 6 / lip6)
- Attaques physiques : modèle de faute, sécurisation de code et analyse de robustesse de protections
- 22.11.2016 :
Mounir Assaf
(Stevens Institute of Technology)
- Hypercollecting Semantics and its Application to Static Analysis of Information Flow
- 15.11.2016 :
Hubert Comon
(ENS Cachan / LSV) -
Indistinguishability proofs
- 09.11.2016 :
Franck Védrine
(CEA LIST) -
Abstract compilation and invariant synthesis based on numerical parametric domains
- 03.11.2016 :
Adel Djoudi
(CEA LIST) -
Recovering High-level Conditions from Binary Programs
- 22.09.2016 :
Antonin Butant
(CEA LIST / LSL) -
Mixing Proved and Unproved Systems Parts through Contracts to ensure Correct-by-Construction System Design
- 20.09.2016 : George Karpenkov
(Université Grenoble Alpes / Verimag) - Code Analysis with Local Policy Iteration
- 30.08.2016 : Roberto Di Cosmo
(Paris 7, INRIA / IRIF) -
Software Heritage