| Year | Name | Thesis | Place of defense |
|---|---|---|---|
| 2024 | Gaëtan Douéneau-Tabot | Optimization of string transducers | Université Paris-Cité (France) |
| Aliaume Lopez | First Order Preservation Theorems in Finite Model Theory: Locality, Topology, and Limit Constructions | ENS Paris-Saclay and Université Paris-Cité (France) | |
| 2023 | Gabriele Vanoni | On Reasonable Space and Time Cost Models for the λ-Calculus | Università di Bologna, (Italy) |
| 2022 | Alexander Bentkamp | Superposition for Higher-Order Logic | Vrije Universiteit Amsterdam (Netherlands) |
| 2021 | Marie Fortin | Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata | ENS Paris-Saclay (France) |
| Sandra Kiefer | Power and Limits of the Weisfeiler-Leman Algorithm | RWTH Aachen (Germany) | |
| 2020 | Benjamin Lucien Kaminski | Advanced Weakest Precondition Calculi for Probabilistic Programs | RWTH Aachen (Germany) |
| 2019 | Antoine Mottet | Dichotomies in Constraint Satisfaction Canonical Functions and Numeric CSPs | Technische Universität Dresden (Germany) |
| 2018 | Amina Doumane | On the Infinitary Proof Theory of Logics with Fixed Points | Université Paris Diderot (France) |
| 2017 | Amaury Pouly | Continuous Models of Computation: From Computability to Complexity | École Polytechnique (France) and Universidade do Algarve (Portugal) |
| 2016 | Nicolai Kraus | Truncation Levels in Homotopy Type Theory | University of Notthingham (UK) |
| 2015 | Hugo Férée | Complexité d’ordre supérieur et analyse récursive | Université de Lorraine (France) |
| Mickael Randour | Synthesis in Multi-Criteria Quantitative Games | Université de Mons (Belgium) | |
| 2014 | Michael Elberfeld | Space and Circuit Complexity of Monadic Second-Order Definable Problems on Tree-Decomposable Structures | University of Lübeck (Germany) |
| 2013 | Matteo Mio | Game Semantics for Probabilistic Modal μ-Calculi | University of Edinburgh (UK) |
| 2012 | Andrew Polonsky | Proofs, Types and Lambda Calculus | University of Bergen (Norway) |
| Szymon Torunczyk | Languages of profinite words and the limitedness problem | University of Warsaw (Poland) | |
| 2011 | Benjamin Rossman | Average Case Complexity of Detecting Cliques | Massachusetts Institute of Technology, Cambridge (USA) |
| 2009 | Jakob Nordström | Short Proofs May Be Spacious: Understanding Space in Resolution | Royal Institute of Technology, Stockholm (Sweden) |
| 2008 | Krishnendu Chatterjee | Stochastic Omega-Regular Games | University of California at Berkeley (USA) |
| 2007 | Dietmar Berwanger | Games and Logical Expressiveness | RWTH Aachen (Germany) |
| Stéphane Lengrand | Normalization and Equivalence in Proof Theory and Type Theory | Université de Paris VII (France) and University of St. Andrews (UK) | |
| Ting Zhang | Arithmetic Integration of Decision Procedures | Stanford University (USA) | |
| 2006 | Balder ten Cate | Model Theory for Extended Modal Languages | Amsterdam University (Netherlands) |
| Stefan Milius | Coalgebras, Monads and Semantics | TU Braunschweig (Germany) | |
| 2005 | Mikołaj Bojańczyk | Decidable Properties of Tree Languages | University of Warsaw (Poland) |
| Konstantin Korovin | Knuth-Bendix orders in automated deduction and term rewriting | University of Manchester (UK) | |
| Nathan Segerlind | New Separations for Propositional Proof Systems | University of California at San Diego (USA) |
Detailed reports on the theses and their authors are published in the proceedings of the CSL conference, at which the award was given.