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

 

 

 

Nombre de documents fulltext

630

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

Mots Clés

Event-B Tom Augmented human Formal verification Cryptographic protocols EMF Term rewriting Birkhoff's ergodic theorem Rewriting ProVerif Combination method Constraint Abstraction Computable Analysis Calculating machine Algorithmic randomness Composition Trace Human systems integration SMT Hedge automata Entropy Formal Verification Intégration Simulation Modelling Invention Symbolic model Behavioral detection Ordering constraint Harm trees Proof assistants Automated verification Finite state automaton Correct-by-construction TLA+ Java Distributed algorithms Algorithms Jost Bürgi Proof-based development Factorization Key-driven Static analysis Refinement Layerwise computability Mathematical induction Authentication Innermost Algorithm Formal methods E-voting Applied π-Calculus Méthodes formelles Computability Dynamical systems Model checking Reachability Social networks Theorem proving Distributed systems Web services Interpretations Dynamic binary instrumentation Formal language Instantiation Language Verification Decision procedures First-order logic Cryptographic Protocols Schwilgué Decidability Event-driven approach Narrowing Computable analysis Security protocols Tilings Collaboration Abstract model Formal method Kolmogorov complexity Polymorphism Online Social Networks OSN Adding machine Deducibility constraints Implicit computational complexity Online Social Network OSN Validation Induction Security Satisfiability Complexity Isabelle/HOL Termination Behavior abstraction Privacy Graph rewriting Formal specification Malware