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

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