Prix du meilleur article pour "The Tree Width of Separation Logic with Recursive Definitions" par Radu Iosif, Adam Rogalewicz, and Jirí Simácek, à CADE 2013 [1].
Browsing
News
New publications
- Some Recent Publications
- Quentin Bramas, Stéphane Devismes, Pascal Lafourcade: Finding Water on Poleless using Melomaniac Myopic Chameleon Robots
- Cristian Ene, Laurent Mounier, Marie-Laure Potet: Output-sensitive Information flow analysis
- Salim CHEHIDA, Abdelhakim Baouya, Saddek Bensalem, Marius Bozga: Learning and analysis of sensors behavior in IoT systems using statistical model checking
- Léo Gourdin, Sylvain Boulmé: Certifying assembly optimizations in Coq by symbolic execution with hash-consing
Jobs and internships
- Jobs and internships
- PhD position: software vulnerability analysis guided by countermeasures and attacker capabilities
- (un)decidability of polyhedral invariant inference
- verified decomposition of arithmetic operators
- Verified global value numbering
- [L3/M1/M2 Internship] Topics in Formally Verified Compilation
- [M2 Internship] Leakage in presence of an active and adaptive adversary
- [M2R Internship] Patch analysis of IIoT components
- [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
