Department 2: Formal methods

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