Talks

1. Look Ma! No interference! (2025)
   SAI Seminar (seminar talk; Linz, Austria)
   Slides
2. Proofs (that contain programs that contain proofs)* (2025)
   AVM 25 (contributed talk; Timisoara, Romania)
   Slides
3. Short proofs without interference (2025)
   SYNASC 25 (contributed talk; Timisoara, Romania)
   Slides
4. Short, composable proofs without interference (2025)
   WHOOPS 25 (contributed talk; Orsay, Paris)
   Slides
5. Open problems in interference and proofs for SAT solving (2024)
   Dagstuhl Seminar 24421: SAT and Interactions (seminar talk; Schloß Dagstuhl, Germany)
   Slides
6. Boolean Quantifier Shifting as an Optimization Problem (2024)
   QUANTIFY 24 (contributed talk; Nancy, France)
   Slides
7. Even Shorter Proofs Without New Variables (2023)
   SAT 2023 (contributed talk; Alghero, Italy)
   Slides
8. Reasoning with Quantified Boolean Formulas (2023)
   FM 2023 (tutorial; Lübeck, Germany)
   Slides
9. Interpolants and interference (2022)
   iPRA 2022 (contributed talk; Haifa, Israel)
   Slides
10. RAT elimination (2021)
    LPAR-23 (contributed talk; online)
    Slides
11. Frying the egg, roasting the chicken: unit deletions in DRAT proofs (2020)
    CPP 2020 (contributed talk; New Orleans, USA)
    Slides
12. Complete and Efficient DRAT Proof Checking (2018)
    FMCAD 2018 (contributed talk; Austin, USA)
    Slides
13. Two flavors of DRAT (2018)
    POS 2018 (contributed talk; Oxford, UK)
    Slides
14. Towards a Semantics of Unsatisfiability Proofs with Inprocessing (2017)
    LPAR-21 (contributed talk; Maun, Botswana)
    Slides
15. DRAT Proofs for XOR Reasoning (2016)
    JELIA 2016 (contributed talk; Larnaca, Cyprus)
    Slides
16. Interpolants from SAT solving certificates (2016)
    Automata, Logic and Games, Workshop on Constraints (tutorial; Singapore)
    Slides