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

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