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

Pour toute question ou remarque au sujet de cette collection, veuillez nous contacter à publications@loria.fr

Derniers Dépôts

Chargement de la page

Nombre de documents fulltext

1 325

Répartition des dépôts par type de document

Mots Clés

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