Department 2: Formal methods

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