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

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