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

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