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

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