Skip to Main content Skip to Navigation

Department 2: Formal methods

 For all your questions or comments about this collection, please contact us at:


Latest deposits

Chargement de la page




Number of full text documents


Submissions distribution by document type


Security Management Harm trees Behavioral detection Security protocols Satisfiability Modulo Theories Termination SMT Proof-based development Algorithms Satisfiability Constraint Unification Augmented human Proof assistants Innermost Narrowing Abstraction Composition Online Social Networks OSN Méthodes formelles Applied π-Calculus Abstract model Online Social Network OSN Contextual equivalence Formal Verification Formal language E-voting First-order logic Authentication Formal proof Complexity Collaboration Decidability Automated verification Validation Semantics Human systems integration Tilings Behavior abstraction Decision procedure Algorithme Entropy Adding machine Completeness Cryptographic protocols Combination method Subshifts Combination Automated reasoning Dynamic binary instrumentation Software-Defined Networking Computability Privacy EMF Event-B Type systems Formal verification Ordering constraint Social networks Trace Security Correct-by-construction Modélisation Verification Boolean function Distributed systems Simulation Computable Analysis Implicit computational complexity Symbolic model Formal method Tom Computable analysis Static analysis Calculating machine Model checking Rewriting TLA+ Formal methods Sécurité Finite state automaton Web services Refinement Event-driven approach Reachability Factorization Modelling Formal Methods Deducibility constraints Distributed algorithms ProVerif Term rewriting Dynamical systems Schwilgué Birkhoff's ergodic theorem Malware Algorithm Cryptographic Protocols Algorithmic randomness Polymorphism