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

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