Department 2: Formal methods

Cryptography Malware Validation Distributed algorithms Calculating machine Collaborative editors Réécriture Parameter synthesis Tilings Model checking Optimistic replication Protocol Applied π-Calculus Decision procedures Détection d'intrusions Event-B Secrecy Completeness Algorithmic randomness Méthodes formelles Model-checking Rewriting Machine Decidability Composition Edward Sang Termination Raffinement Déduction automatique Implicit computational complexity Tree automata Symbolic model Coq Schwilgué Abstraction Behavioral detection Protocoles cryptographiques SMT Proof assistants Semantics Protocoles First-order logic Computability Static analysis Refinement TLA+ Formal Verification Intrusion detection Deducibility constraints Cryptographic protocols IMITATOR Automated deduction Social networks Parametric timed automata Web services Formal language Automated reasoning Complexity Logarithms Constraint solving Pattern matching Satisfiability Modulo Theories Narrowing Reachability Formal verification Combination Algorithm Linear arithmetic Vérification Security protocols Automated verification Sines Online Social Networks OSN Liveness Decision procedure Protocols Unification Term rewriting Satisfiability Verification Distributed systems Cellular automata Operational transformation Simulation E-voting Proof-based development Symbolic animation Privacy Formal Methods Authentication Combination of decision procedures Sécurité Equational theories Formal methods Theorem proving Modelling Computable analysis Automatic theorem provers Operational Transformation Security