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

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