Department 2: Formal methods

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