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

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