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

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