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

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