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

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