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

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