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

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