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

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