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

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