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

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