Department 2: Formal methods

E-voting Optimistic replication Term rewriting Automatic theorem provers Edward Sang Decision procedures Decision procedure Verification Computability Termination Higher-order logic Complexity Tilings Web services Satisfiability Modulo Theories Timed automata Computable analysis Composition Security protocols Process calculi Synchronization Social networks Dependent types SMT Static analysis Temporal logic Symbolic model Refinement TLA+ Formal methods Theorem proving Cryptography Formal Verification Formal method Parameter synthesis Symbolic animation Protocol Operational transformation Separation logic Almost full relations Méthodes formelles Tree automata Authentication Model-checking Raffinement Narrowing Proof-based development Superposition Coq Protocols Cryptographic protocols Equational theories Sines Obfuscation Semantics Validation Behavioral detection Model checking Sécurité Proof assistants Automated reasoning Réécriture Completeness Logarithms Formal verification Privacy Applied π-Calculus Decidability Formal Methods Combination Algorithmic randomness Simulation Security IMITATOR First-order logic Animation Algorithm Parametric timed automata Reachability Automated deduction Abstract machines Implicit computational complexity Unification Intrusion detection Schwilgué Rewriting Automated verification Liveness Protocoles cryptographiques Distributed systems Event-B Polynomial time Distributed algorithms Protocoles Abstraction Secrecy Modelling Satisfiability Malware Vérification