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

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