Department 2: Formal methods

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