In the domain of security, verification is generally declined as robustness criteria and must be led against attacker models. We propose tools and technics dedicated to the evaluation of secure devices (smartcard or secured dongle) against fault attacks (such as laser or electromagnetic attacks). We are also interested for modeling and verifying other security requirements (confidentiality, integrity, isolation...) in particular in the context of Common Criteria certification.
Browsing
News
- Conferences
- Feb. 24, 2020 Workshop CAPITAL
- May 11-15, 2020 AlgoTel et CoRes 2020
- June 22-26, 2020 MOVEP 2020
Seminars
- Seminars
- 16 December 2019 Lélio Brun: Verified compilation of the lustre modular reset
- 19 December 2019 Yannick Zakowski: From representing recursive and impure programs in coq to a modular formal semantics (...)
- 19 December 2019 Hang Yu: Towards an efficient parallel parametric linear programming solver (Phd)
- 6 February 2020 Jules Chouquet: Lower bounds for probabilistic k-set agreement through combinatorial (...)
Latest news
- Latest news items
- 28 December 2019 Doctorat Honoris Causa UGA pour Moshe Vardi
New publications
- Recent Publications
- Victor Magron, Alexandre Rocca, Thao Dang: Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations
- Thao Dang, Tommaso Dreossi, Eric Fanchon, Oded Maler, Carla Piazza, Alexandre Rocca: Set-Based Analysis for Biological Modelling
- Thibaut Balabonski, Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain: Manuel de savoir-prouver à l'usage des roboteux et des distributeux
- Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain: Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots on Graphs
- Quentin Bramas, Stéphane Devismes, Pascal Lafourcade: Brief Announcement: Infinite Grid Exploration by Disoriented Robots
- Alexey Bakhirkin, Nicolas Basset: Specification and Efficient Monitoring Beyond STL
