EATCS Best Paper Award
- Paul Fiterau-Brostean, Simon Dierl, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist. Scalable
Tree-based Register Automata Learning (TACAS)
EASST Best Paper Award
- Nils Husung, Clemens Dubslaff, Holger Hermanns, and Maximilian Alexander Köhl. OxiDD: A Safe, Concurrent, Modular,
and Performant Decision Diagram Framework in Rust (TACAS)
EAPLS Best Paper Award
- Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann and Tobias Winkler. Accurately Computing Expected Visiting
Times and Stationary Distributions in Markov Chains
- Raphaël Monat, Aymeric Fromherz, and Denis Merigoux. Formalizing Date Arithmetic and Statically Detecting
Ambiguities for the Law
The paper describes the development of a novel tool, i.e., the domain-specific language Catala and its application to
French law. It is a fantastic example of the application of techniques from programming languages to solve a real-world
problem, and is about formalizing computation with date information in legal contexts, such as applying for social
benefits or whether an application has been filed on time. The novelty of the problem was particularly appreciated. This
paper is a very nicely executed analysis of the problem, well illustrated with many examples. There is a clear
non-trivial theory and an effective implementation that found issues and showed counterexamples.
Award Nominations
- Yu-Fang Chen, David Chocholatý, Vojtěch Havlena, Lukáš Holík, Ondrej Lengal and Juraj Síč. Z3-Noodler: An
Automata-based String Solver
- He Xu, Sven Schneider, and Holger Giese. Integrating Look-ahead Design-time and Run-time Control-synthesis for
Graph Transformation Systems
- Liushan Chen, Yu Pei, Mingyang Wan, Zhihui Fei, Tao Liang, and Guojun Ma. Smart Issue Detection for Large-Scale
Online Service Systems Using Multi-Channel Data
- Francesco Gavazzo, Riccardo Treglia and Gabriele Vanoni. Monadic Intersection Types, Relationally
- Paul Fiterau-Brostean, Simon Dierl, Falk Howar, Bengt Jonsson, Konstantinos Sagonas and Fredrik Tåquist. Scalable
Tree-based Register Automata Learning
- Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann and Tobias Winkler. Accurately Computing Expected Visiting Times
and Stationary Distributions in Markov Chains
- Hrutvik Kanabar, Kacper Korban and Magnus O. Myreen. Verified Inlining and Specialisation for PureCake
- Balder ten Cate and Jesse Comer. Craig Interpolation for Decidable First-Order Fragments
- Nils Husung, Clemens Dubslaff, Holger Hermanns and Maximilian Alexander Köhl. OxiDD: A Safe, Concurrent, Modular,
and Performant Decision Diagram Framework in Rust
- Raphaël Monat, Aymeric Fromherz and Denis Merigoux. Formalizing Date Arithmetic and Statically Detecting
Ambiguities for the Law
- Pierre Lermusiaux and Benoit Montagu. Detection of Uncaught Exceptions in Functional Programs by Abstract
Interpretation