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

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