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

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