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

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