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

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