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

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