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

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