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

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