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


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