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

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