Department 2: Formal methods

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