Accueil > Axes > FETLAS > Emplois et stages
Silent Self-Stabilizing Algorithms : Certification Using Coq
Navigation
Actualités
- Séminaires
- 31 mai 2022 Matheus Schuh: Safe implementation of hard real-time applications on many-core platforms (Phd)
- 3 juin 2022 Capital Workshop : Workshop capital 2022 : scalable and precise timing analysis for multicore (...)
- 14 juin 2022 Joel Goossens: Real-time computing, foundation
- 16 juin 2022 Joel Goossens: Periodicity of real-time priority driven schedulers with preemption delay on (...)
- 21 juin 2022 Joel Goossens: Real-time computing, multiprocessor scheduling problems
Séminaires
Nouvelles publications
- Quelques Publications
Récentes
- Cyril Six: Optimized and formally-verified compilation for a VLIW processor
- Guillaume Brau, Mohammed Foughali: Contract-Based Verification of Model Transformations: A Formally Founded Approach
- David Monniaux, Cyril Six: Simple, light, yet formally verified, global common subexpression elimination and loop-invariant code motion
- Stéphane Devismes, Pascal Lafourcade: Un jour sans fin
Offres d'emploi et stages
- Offres d'emploi et stages
- (un)decidability of polyhedral invariant inference
- Thèse CIFRE : Cybersecurity - Fault injection attacks
- Thèse/PhD Position - Coverage Measures for Machine Learning Enabled Cyber-Physical Systems
- verified decomposition of arithmetic operators
- Verified global value numbering
- [L3/M1/M2 Internship] Topics in Formally Verified Compilation
- [master or PhD] Convex polyhedra in floating point
- [master] automatic insertion of countermeasures in a verified compiler
- [Master] Decision Procedures for Separation Logic Modulo Theories of Data
- [Master] Design and Evaluation of Strategies for Automated Proofs using Reasoning Modulo Equivalence
- [master] formally verified hash-consing
- [Master] Local Reasoning about Reconfigurable Component-based Systems
- [Master] Multi-core Interference analysis and Global Scheduling
- [Master] Simulation of Distributed Algorithms
- [Master] Verifying Concurrent Systems with Automata over Infinite Alphabets