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

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