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

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