Best ETAPS Paper

The prize of "Best ETAPS Paper" is presented to the best theoretical paper at ETAPS.

Selection panel members: Anca Muscholl (Bordeaux), Ugo dal Lago (Bologna) and Andrzej Murawski (Oxford).

Panel renewal rule: Members of the selection panel are appointed for a fixed term of 3 years, and they can serve at most two terms consecutively.

European Association for Programming Languages and Systems (EAPLS) also presents a Best Paper Award, which has been awarded since ETAPS'98.

A brief history of the prize follows below.

2025 / Hamilton

Pablo Barenbaum and Eduardo Bonelli: "Sharing and Linear Logic with Restricted Access" (FoSSaCS)

Patricia Bouyer, B Srivathsan and Vaishnavi Vishwanath: "Model-checking real-time systems: revisiting the alternating automaton route" (FoSSaCS)

2024 / Luxembourg

Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist: "Scalable Tree-based Register Automata Learning" TACAS 2024

2023 / Paris

Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar Ibarra, Ian McQuillan, Lia Schütze and Georg Zetzsche: "Unboundedness problems for machines with reversal-bounded counters" FoSSaCS 2023

2022 / Munich

Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion and Romain Péchoux: "Complete and tractable machine-independent characterizations of second-order polytime" FoSSaCS 2022

2021 / Luxembourg

Robin Piedeleu and Fabio Zanasi: "A String Diagrammatic Axiomatisation of Finite-State Automata""

Bartek Klin, Sławomir Lasota, and Szymon Toruńczyk: "Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages"

2020 / Dublin

Thomas Neele, Antti Valmari and Tim A.C. Willemse: "The inconsistent labelling problem of stutter-preserving partial-order reduction"

2019 / Prague

Jérémy Dubut: "Trees in Partial Higher Dimensional Automata (FoSSaCS 2019)"

2018 / Thessaloniki

Sergey Goncharov and Lutz Schröder: "Guarded Traced Symmetric Monoidal Categories (FoSSaCS 2018)"

2017 / Uppsala

Sam Staton: "Commutative Semantics for Probabilistic Programming (ESOP 2017)"

Alex Simpson: "Cyclic Arithmetic Is Equivalent to Peano Arithmetic (FoSSaCS 2017)"

Stefano Berardi, Makoto Tatsuta: "Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System. (FoSSaCS 2017)"

2016 / Eindhoven

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja and Federico Olmedo: "Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (ESOP)"

Neil Ghani, Fredrik Nordvall Forsberg, and Alex Simpson: "Comprehensive Parametric Polymorphism: Categorical Models and Type Theory (FOSSACS)"

2015 / London

Konstantinos Mamouras: "Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism (FoSSaCS 2015)"

2014 / Grenoble

Christel Baier, Joachim Klein, Sascha Klueppelholz and Steffen Märcker: "Computing Conditional Properties in Markovian Models Efficiently"

Naoki Kobayashi, Kazuhiro Inaba and Takeshi Tsukada: "Unsafe Order-2 Tree Languages are Context-Sensitive"

2013 / Rome

Michele Bugliesi, Stefano Calzavara, Fabienne Eigner, Matteo Maffei: "Logical Foundations of Secure Resource Management in Protocol Implementations"

2012 / Tallinn

Sebastian Preugschat, Thomas Wilke: "Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata"


	2011 / Saarbrücken Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala: "Canonized Rewriting and Ground AC-Completion Modulo Shostak Theories"


	2010 / Paphos Parosh Abdulla, Yu-Fang Chen, Lukas Holik, Richard Mayr, Tomas Vojnar: "When Simulation Meets Antichains (on Checking Language Inclusion of NFA's)"