Department 2: Formal methods

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