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

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