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

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