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

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