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

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