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

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