Department 2: Formal methods

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