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

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