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

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