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

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