Talks

    • SAT Preprocessing
      Presentation by Mate Soos at the Dagstuhl Seminar 26221
      Dagstuhl 26th of May, 2026
      [PDF]
    • Arjun as a Boolean-Function Synthesis Engine
      Presentation by Mate Soos at the Dagstuhl Seminar 26221
      Dagstuhl 26th of May, 2026
      [PDF]
    • Boolean Functional Synthesis and its possible application to Cryptography
      Presentation by Mate Soos at COSIC
      KU Leuven, 8th of July 2025
      [PDF]
    • SAT Preprocessing
      Presentation at The SAT Winter School
      IIIT Hyderabad, India, December 17, 2023
      [PDF]
    • On Quantitative Testing of Samplers
      Presentation at The Simons Institute’s Satisfiability: Theory, Practice, and Beyond Reunion
      Simons Institute, 15th of June 2022
      [PDF]
    • Solving CNF-XOR Formulas: A Practical Perspective
      Presentation at The Simons Institute’s Satisfiability: Theory, Practice, and Beyond
      Simons Institute, 21st of February 2021
      [PDF]
    • SAT Solving and CDCL(T)
      Presentation at SAT+SMT Winter School.
      Indian Institute of Technology Bombay, Mumbai, India, 2019
      [PDF]
    • Machine Learning Clause DB Managment
      Presentation at Dagstuhl Seminar 19062: Bringing CP, SAT and SMT together: Next Challenges in Constraint Solving.
      Schloss Dagstuhl – Leibniz Center for Informatics, Wadern, Germany, 2019
      [PDF]
    • Hacking using SAT and SMT Solvers
      Presentation at EMF Camp 2018.
      Eastnor, UK, 1st of September 2018
      [PDF]
    • Lessons Learnt — Seven Years of CryptoMiniSat
      Presentation at Pragmatics of SAT 2016, a workshop of the SAT 2016 conference
      Bordeaux, France, 4th of July 2016
      [PDF]
    • Infosec Through People, Process and Technology
      Presentation at kLab Kigali
      Kigali, Rwanda, 23 of December 2015
      [PDF]
    • SAT Solvers and their Applications
      Presentation at Hackito Ergo Sum 2014
      Paris, France, 26 of April 2014
      [PDF]
    • Limits of SAT Solvers in Cryptography
      Presentation at CASED
      July 2011, Darmstadt, Germany
      [PDF]
    • CryptoMiniSat — A Rough Guide
      Presentation at SMT/SAT Summer School’11
      MIT, USA, 14th of June 2011
      [PDF]
    • Cracking Industrial Ciphers at a Whim
      Presentation at Hackito Ergo Sum’11
      Paris, France, 7th of April 2011
      [PDF]
    • SAT Solver Architectures
      Presentation at the Institute for Formal Models and Verification, Linz
      Linz, Austria, 9th of February 2011
      [PDF]
    • Using SAT Solvers for Cryptographic Problems
      Presentation at Microsoft Research, Cambridge
      Cambridge, UK, 5th of November 2010
      [PDF]
    • SAT Solvers and Configuration Management
      Presentation for the Mancoosi Project
      Paris, France, 2nd of November 2010
      [PDF]
    • Enhanced Gaussian Elimination in DPLL-based SAT Solvers
      Presentation at the Pragmatics of SAT workshop 2010
      Edinburgh, Scotland, UK, 10th of July 2010
      [PDF]
    • Grain of Salt — An Automated Way to Test Stream Ciphers through SAT Solvers
      Presentation at Workshop on Tools for Cryptanalysis 2010
      Royal Holloway, University of London (UK), 23rd of June 2010
      [PDF]
    • SAT Solvers in the Context of Cryptography 2.0
      Presentation for the sercurity group of Montpellier’s LIRMM laboratory
      Montpellier, France, 10th of June 2010
      [PDF]
    • SAT Solvers in the Context of Cryptography
      Presentation for Rennes’s Cryptography Seminar
      Rennes, France, 7th of May 2010
      [PDF]
    • SAT Solvers in the Context of Stream Ciphers
      Presentation for Jurnees C2
      Frejus, France, 8th of October 2009
      [PDF]
    • Privacy-preserving Security Protocols for RFIDs
      Thesis defense
      Grenoble, France, 6th of October 2009
      [PDF]
    • Extending SAT Solvers to Cryptographic Problems
      Presentation for SAT 2009
      Swansea, England, 1th of July 2009
      [PDF]
    • RFID standards – ISO14443,ISO15693 and EPCGlobal
      Planete Seminar
      Grenoble, France, 19th of May 2008
      [PDF]