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

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