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

563

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

Mots Clés

Term rewriting Polymorphism Narrowing Implicit computational complexity Computable analysis Quasi-interpretation Cryptographic Protocols Probability Verification Deducibility constraints Formal Verification Dynamic binary instrumentation Event-B Event-driven approach Security protocols Rewriting Proof Theory Authentication Computable Analysis Trace Mathematical induction Decidability Formal verification Polynomial time Collaboration Proof-based development Formal methods Language Modelling Polynomial Time Entropy Formal specification Graph rewriting EMF Formal language Finite state automaton Distributed algorithms Algorithm Refinement Reachability Priority rewriting Computability Innermost Interpretations Algorithmic randomness Intégration Termination Correct-by-construction Theorem proving Complexity Behavioral detection Invention Factorization Human systems integration Protocol Security Distributed systems SMT Malware Induction Rewrite closure Composition Satisfiability Tom Java Probabilistic cellular automata Simulation Calculating machine Validation Completeness Jost Bürgi Augmented human Constraint Schwilgué Hedge automata E-voting Automated verification Orchestration Key-driven Abstraction Adding machine Abstract model Tilings Ordering constraint Birkhoff's ergodic theorem Privacy Applied π-Calculus Combination method ProVerif Cryptographic protocols Mechanical verification Layerwise computability Web services Model checking TLA+ Dynamical systems Process calculi Behavior abstraction Kolmogorov complexity Réécriture