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

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