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

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