Department 2: Formal methods

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