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

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