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

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