Department 2: Formal methods

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