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

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