Sous-collection du département 2 : Méthodes formelles

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