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

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