Department 2: Formal methods

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