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


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