Previous Awards

The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. It is presented during the annual conference of the EACSL (CSL’xx). Since 2017, the Award is sponsored by the association Alumni der Informatik Dortmund e.V. From 2010 to 2016, the Award has been sponsored by the Kurt Gödel Society. For the three years 2007-2009, the Award was sponsored by Logitech, S.A., Romanel, Switzerland, the world’s leading provider of personal peripherals.
YearNameThesisPlace of defense
2022Alexander BentkampSuperposition for Higher-Order LogicVrije Universiteit Amsterdam (Netherlands)
2021Marie FortinExpressivity of first-order logic, star-free propositional dynamic logic and communicating automataENS Paris-Saclay (France)
Sandra KieferPower and Limits of the Weisfeiler-Leman AlgorithmRWTH Aachen (Germany)
2020Benjamin Lucien KaminskiAdvanced Weakest Precondition Calculi for Probabilistic ProgramsRWTH Aachen (Germany)
2019Antoine MottetDichotomies in Constraint Satisfaction Canonical Functions and Numeric CSPsTechnische Universität Dresden (Germany)
2018Amina DoumaneOn the Infinitary Proof Theory of Logics with Fixed PointsUniversité Paris Diderot (France)
2017Amaury PoulyContinuous Models of Computation: From Computability to ComplexityÉcole Polytechnique (France) and Universidade do Algarve (Portugal)
2016Nicolai KrausTruncation Levels in Homotopy Type TheoryUniversity of Notthingham (UK)
2015Hugo Férée Complexité d’ordre supérieur et analyse récursiveUniversité de Lorraine (France)
Mickael RandourSynthesis in Multi-Criteria Quantitative GamesUniversité de Mons (Belgium)
2014Michael ElberfeldSpace and Circuit Complexity of Monadic Second-Order Definable Problems on Tree-Decomposable StructuresUniversity of Lübeck (Germany)
2013Matteo MioGame Semantics for Probabilistic Modal μ-CalculiUniversity of Edinburgh (UK)
2012Andrew Polonsky Proofs, Types and Lambda CalculusUniversity of Bergen (Norway)
Szymon TorunczykLanguages of profinite words and the limitedness problemUniversity of Warsaw (Poland)
2011Benjamin Rossman Average Case Complexity of Detecting CliquesMassachusetts Institute of Technology, Cambridge (USA)
2009Jakob NordströmShort Proofs May Be Spacious: Understanding Space in ResolutionRoyal Institute of Technology, Stockholm (Sweden)
2008Krishnendu ChatterjeeStochastic Omega-Regular GamesUniversity of California at Berkeley (USA)
2007Dietmar BerwangerGames and Logical ExpressivenessRWTH Aachen (Germany)
Stéphane LengrandNormalization and Equivalence in Proof Theory and Type TheoryUniversité de Paris VII (France) and University of St. Andrews (UK)
Ting ZhangArithmetic Integration of Decision ProceduresStanford University (USA)
2006Balder ten Cate Model Theory for Extended Modal LanguagesAmsterdam University (Netherlands)
Stefan MiliusCoalgebras, Monads and SemanticsTU Braunschweig (Germany)
2005Mikołaj BojańczykDecidable Properties of Tree LanguagesUniversity of Warsaw (Poland)
Konstantin KorovinKnuth-Bendix orders in automated deduction and term rewritingUniversity of Manchester (UK)
Nathan Segerlind New Separations for Propositional Proof SystemsUniversity 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.