Department 2: Formal methods

 For all your questions or comments about this collection, please contact us at: publications@loria.fr

 

Latest deposits

 

 

 

Number of full text documents

636

Submissions distribution by document type

Keywords

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