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


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